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)
05C35: Extremal problems in graph theory
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
Related Items
Maximum size of a planar graph with given degree and diameter, The degree/diameter problem in maximal planar bipartite graphs, On the maximum order of graphs embedded in surfaces, Steiner diameter of 3, 4 and 5-connected maximal planar graphs, The degree-diameter problem for sparse graph classes, An introduction to the discharging method via graph coloring, Maximum size of a planar graph with given degree and even diameter, Largest planar graphs and largest maximal planar graphs of diameter two, Dynamic coloring parameters for graphs with given genus, Large planar graphs with given diameter and maximum degree, The degree-diameter problem for outerplanar graphs, A unified approach to distance-two colouring of graphs on surfaces, Distance-two coloring of sparse graphs
Cites Work