Arthur S. Finbow - Concepedia

Author

Arthur S. Finbow

Also Known As

A. Finbow, A. S. Finbow, A. Stephen Finbow, A.S. Finbow, Arthur S. Finbow

Publications

332

Citations

H-Index

Concepts

All Affiliations

Arthur S. Finbow is an author at Saint Mary's University specializing in discrete mathematics, graph theory, and natural sciences.

#	Concept	H-Index	Publications	Citations
1	Education	1	1	138
2	Natural Sciences	1	1	13
3	Combinatorial Optimization	1	1	53
4	Geometric Modeling	1	1	13
5	Computational Geometry	1	1	13

Arthur S. Finbow

Publications

277

Citations

H-Index

Page 1

	Year	Citations
A Characterization of Well Covered Graphs of Girth 5 or Greater Arthur S. Finbow, Bert L. Hartnell, Richard J. Nowakowski Journal of Combinatorial Theory Series B Graph MinorWell Covered GraphsGeometric Graph TheoryGraph TheoryTopological Graph Theory	1993	138
A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles Arthur S. Finbow, Bert L. Hartnell, Richard J. Nowakowski Journal of Graph Theory Geometric Graph TheoryWell‐covered Graph GGraph TheoryAlgebraic Graph TheoryStructural Graph Theory	1994	62
On the packing chromatic number of some lattices Arthur S. Finbow, Douglas F. Rall Discrete Applied Mathematics Lattice (Order)Graph TheoryCombinatorial Design TheoryPacking Chromatic NumberDiscrete Mathematics	2009	53
On well-covered triangulations: Part II Arthur S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Discrete Applied Mathematics Geometric ModelingGeometric AlgorithmGeometryNatural SciencesDiscrete Differential Geometry	2009	13
A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets Arthur S. Finbow, Bert L. Hartnell, Carol Whitehead Discrete Mathematics Geometric Graph TheoryGraph TheoryStructural Graph TheoryTopological Graph TheoryExtremal Combinatorics	1994	11

Page 1