Login / Signup

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

Seog-Jin KimDouglas B. West
Published in: Discuss. Math. Graph Theory (2008)
Keyphrases
  • planar graphs
  • integer programming
  • objective function
  • closed form
  • minimum cost
  • minimum weight