On the maximum order of graphs embedded in surfaces

DOI10.1016/j.jctb.2015.12.004zbMath1334.05028arXiv1312.1753OpenAlexW70497260MaRDI QIDQ273165

David R. Wood, Guillermo Pineda-Villavicencio, Eran Nevo

Publication date: 21 April 2016

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.1753

zbMATH Keywords

surfacevertex separatordegree-diameter problemgraphs on surfaces

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex degrees (05C07)

Related Items (3)

The degree-diameter problem for outerplanar graphs ⋮ The degree/diameter problem in maximal planar bipartite graphs ⋮ The degree-diameter problem for sparse graph classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The degree-diameter problem for sparse graph classes
• Maximum size of a planar graph with given degree and even diameter
• \(N\)-separators in planar graphs
• Largest planar graphs of diameter two and fixed maximum degree
• Constructions of large graphs on surfaces
• Large planar graphs with given diameter and maximum degree
• Spanning trees of dual graphs
• Moore graphs and beyond: a survey of the degree/diameter problem
• Spanning subgraphs of embedded graphs
• The cycle space of an embedded graph
• A Separator Theorem for Planar Graphs
• Constructions of large planar networks with given degree and diameter
• Extremal graphs of diameter two and given maximum degree, embeddable in a fixed surface

This page was built for publication: On the maximum order of graphs embedded in surfaces