The degree-diameter problem for outerplanar graphs
From MaRDI portal
Publication:2364099
Recommendations
Cites work
- A Separator Theorem for Planar Graphs
- A characterisation of eccentric sequences of maximal outerplanar graphs
- Abelian Cayley graphs of given degree and diameter 2 and 3
- Cayley graphs of diameter two and any degree with order half of the Moore bound
- Centers of maximal outerplanar graphs
- Computation of the center and diameter of outerplanar graphs
- Large bipartite Cayley graphs of given degree and diameter
- Large planar graphs with given diameter and maximum degree
- Large vertex-transitive graphs of diameter 2 from incidence graphs of biaffine planes
- Largest planar graphs and largest maximal planar graphs of diameter two
- Largest planar graphs of diameter two and fixed maximum degree
- Maximal planar graphs of diameter two
- Maximum size of a planar graph with given degree and even diameter
- On bipartite graphs of defect at most 4
- On the maximum order of graphs embedded in surfaces
- The degree-diameter problem for claw-free graphs and hypergraphs
- The degree/diameter problem in maximal planar bipartite graphs
Cited in
(10)- Maximal outerplane graphs of extremal diameter
- The degree/diameter problem in maximal planar bipartite graphs
- The degree/diameter problem in maximal planar bipartite graphs
- A family of graphs and the degree/diameter problem
- Approximate realizations for outerplanaric degree sequences
- Augmenting outerplanar graphs to meet diameter requirements
- scientific article; zbMATH DE number 825130 (Why is no real title available?)
- The degree-diameter problem for sparse graph classes
- scientific article; zbMATH DE number 5309966 (Why is no real title available?)
- Vertex degrees in outerplanar graphs
This page was built for publication: The degree-diameter problem for outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364099)