The degree/diameter problem in maximal planar bipartite graphs

zbMath1335.05044MaRDI QIDQ5890615

C. Dalfó, Clemens Huemer, Julián Salas

Publication date: 3 May 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i1p60

zbMATH Keywords

planar graphsbipartite graphsdegree/diameter problem

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (3)

The degree-diameter problem for outerplanar graphs ⋮ New Moore-like bounds and some optimal families of abelian Cayley mixed graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the maximum order of graphs embedded in surfaces
• 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
• Covering planar graphs with a fixed number of balls
• Largest planar graphs and largest maximal planar graphs of diameter two
• Large planar graphs with given diameter and maximum degree
• Maximal planar graphs of diameter two
• A Separator Theorem for Planar Graphs
• Two trees in maximal planar bipartite graphs
• Constructions of large planar networks with given degree and diameter

This page was built for publication: The degree/diameter problem in maximal planar bipartite graphs