The degree-diameter problem for outerplanar graphs
From MaRDI portal
Publication:2364099
DOI10.7151/dmgt.1969zbMath1366.05054OpenAlexW2593442973MaRDI QIDQ2364099
Elizabeth Jonck, Tomáš Vetrík, Peter Dankelmann
Publication date: 17 July 2017
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1969
Cites Work
- Unnamed Item
- On the maximum order of graphs embedded in surfaces
- Large vertex-transitive graphs of diameter 2 from incidence graphs of biaffine planes
- Cayley graphs of diameter two and any degree with order half of the Moore bound
- Abelian Cayley graphs of given degree and diameter 2 and 3
- Large bipartite Cayley graphs of given degree and diameter
- Maximum size of a planar graph with given degree and even diameter
- Largest planar graphs of diameter two and fixed maximum degree
- On bipartite graphs of defect at most 4
- Computation of the center and diameter of outerplanar graphs
- Largest planar graphs and largest maximal planar graphs of diameter two
- Large planar graphs with given diameter and maximum degree
- The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs
- Maximal planar graphs of diameter two
- A Separator Theorem for Planar Graphs
- Centers of maximal outerplanar graphs
- The degree/diameter problem in maximal planar bipartite graphs
This page was built for publication: The degree-diameter problem for outerplanar graphs