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

Authors:
S. A. Tishchenko
Affiliations:
-
Venue:
European Journal of Combinatorics
Year:
2012

Citing 3
Cited 0

Largest planar graphs of diameter two and fixed maximum degree

Discrete Mathematics
Large planar graphs with given diameter and maximum degree

Discrete Applied Mathematics
N-separators in planar graphs

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.