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

DOI10.1016/j.ejc.2011.09.005zbMath1230.05178OpenAlexW2078220794MaRDI QIDQ661947

S. A. Tishchenko

Publication date: 11 February 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2011.09.005

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Vertex degrees (05C07)

Related Items (9)

On the maximum order of graphs embedded in surfaces ⋮ The degree-diameter problem for outerplanar graphs ⋮ The degree/diameter problem for mixed abelian Cayley graphs ⋮ New Moore-like bounds and some optimal families of abelian Cayley mixed graphs ⋮ The degree/diameter problem in maximal planar bipartite graphs ⋮ The degree-diameter problem for sparse graph classes ⋮ The degree/diameter problem in maximal planar bipartite graphs ⋮ Constructions of large graphs on surfaces ⋮ An improved Moore bound and some new optimal families of mixed abelian Cayley graphs

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 even diameter