Largest planar graphs of diameter two and fixed maximum degree
From MaRDI portal
Publication:686482
DOI10.1016/0012-365X(93)90166-QzbMath0837.05074MaRDI QIDQ686482
Publication date: 23 April 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (16)
On the maximum order of graphs embedded in surfaces ⋮ The degree-diameter problem for outerplanar graphs ⋮ Maximum size of a planar graph with given degree and diameter ⋮ Large planar graphs with given diameter and maximum degree ⋮ Dynamic coloring parameters for graphs with given genus ⋮ Coloring the square of maximal Planar graphs with diameter two ⋮ Quantum routing in planar graph using perfect state transfer ⋮ A unified approach to distance-two colouring of graphs on surfaces ⋮ Distance-two coloring of sparse graphs ⋮ The degree/diameter problem in maximal planar bipartite graphs ⋮ Steiner diameter of 3, 4 and 5-connected maximal planar graphs ⋮ Maximum size of a planar graph with given degree and even diameter ⋮ The degree-diameter problem for sparse graph classes ⋮ An introduction to the discharging method via graph coloring ⋮ Structure and pancyclicity of maximal planar graphs with diameter two ⋮ Largest planar graphs and largest maximal planar graphs of diameter two
Cites Work
This page was built for publication: Largest planar graphs of diameter two and fixed maximum degree
