Concepedia

Arthur S. Finbow

AS

5

Publications

277

Citations

5

H-Index

1993

Active since

Affiliations

Saint Mary's University(Current)

Dalhousie University

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

Top concepts

Graph TheoryDiscrete MathematicsGeometryEducationNatural SciencesNetwork AnalysisGeometry ModelingComputer-aided DesignComputational GeometryCombinatorial Optimization

Publications per year

1993–2009

5

Publications

5

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 · 1993 · 138 citations

Graph Minor, Well Covered Graphs, Geometric Graph Theory +8

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 · 1994 · 62 citations

Geometric Graph Theory, Well‐covered Graph G, Graph Theory +8

On the packing chromatic number of some lattices

Arthur S. Finbow, Douglas F. Rall · Discrete Applied Mathematics · 2009 · 53 citations

Lattice (Order), Graph Theory, Combinatorial Design Theory +4

On well-covered triangulations: Part II

Arthur S. Finbow, Bert L. Hartnell, Richard J. Nowakowski et al. · Discrete Applied Mathematics · 2009 · 13 citations

Geometric Modeling, Geometric Algorithm, Geometry +6

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 · 1994 · 11 citations

Geometric Graph Theory, Graph Theory, Structural Graph Theory +6

Rows per page

1–5 of 5