The degree/diameter problem in maximal planar bipartite graphs

DOI10.1016/j.endm.2014.08.011zbMath1337.05024OpenAlexW2299483631MaRDI QIDQ5965484

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

Publication date: 13 May 2016

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/26448

zbMATH Keywords

\((\Delta, D)\) problemmaximal planar bipartite graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Maximum size of a planar graph with given degree and even diameter
• \(N\)-separators in planar graphs
• Covering planar graphs with a fixed number of balls
• Large planar graphs with given diameter and maximum degree
• A Separator Theorem for Planar Graphs
• Two trees in maximal planar bipartite graphs

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