Triangle-free planar graphs with minimum degree 3 have radius at least 3

DOI10.7151/dmgt.1428zbMath1172.05317OpenAlexW2018876503MaRDI QIDQ3633847

Seog-Jin Kim, Douglas B. West

Publication date: 23 June 2009

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1428

zbMATH Keywords

triangle-freeminimum degreedominating setradiusplanar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)