论文信息 - Maximum size of a planar graph with given degree and even diameter

Maximum size of a planar graph with given degree and even diameter

We offer the exact solution of the degree-diameter problem for planar graphs in the case of even diameter 2d and large degree @D>=6(12d+1). New graph examples are constructed improving the lower bounds for @D>=5.

S. A. Tishchenko

[1] S. A. Tishchenko. N-separators in planar graphs , 2012, Eur. J. Comb..

[2] P. Hell,et al. Constructions of large planar networks with given degree and diameter , 1998, Networks.

[3] R. Tarjan,et al. A Separator Theorem for Planar Graphs , 1977 .

[4] Michael R. Fellows,et al. Large Planar Graphs with Given Diameter and Maximum Degree , 1995, Discret. Appl. Math..

[5] Michael R. Fellows,et al. Constructions of large planar networks with given degree and diameter , 1998, Networks.

[6] Pavol Hell,et al. Largest planar graphs of diameter two and fixed maximum degree , 1993, Discret. Math..