Maximum size of a planar graph with given degree and diameter

DOI10.1016/j.endm.2008.06.032zbMath1267.05100OpenAlexW2039959475MaRDI QIDQ5301000

S. A. Tishchenko

Publication date: 28 June 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2008.06.032

zbMATH Keywords

planar graphsseparatordegree-diametre problem

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Unnamed Item
• \(N\)-separators in planar graphs
• Largest planar graphs of diameter two and fixed maximum degree
• Large planar graphs with given diameter and maximum degree
• A Separator Theorem for Planar Graphs
• Constructions of large planar networks with given degree and diameter

This page was built for publication: Maximum size of a planar graph with given degree and diameter