Maximal planar graphs of diameter two
From MaRDI portal
Recommendations
Cited in
(18)- Small cycle double covers of 4-connected planar graphs
- Largest planar graphs and largest maximal planar graphs of diameter two
- On Eulerian and regular perfect path double covers of graphs
- Structure and pancyclicity of maximal planar graphs with diameter two
- Computation on the difference of Zagreb indices of maximal planar graphs with diameter two
- List coloring and diagonal coloring for plane graphs of diameter two
- The degree-diameter problem for outerplanar graphs
- On the vertex arboricity of planar graphs of diameter two
- Steiner diameter of 3, 4 and 5-connected maximal planar graphs
- Plane graphs with large faces and small diameter
- Circuit double covers of graphs
- The degree/diameter problem in maximal planar bipartite graphs
- The degree/diameter problem in maximal planar bipartite graphs
- Coloring the square of maximal Planar graphs with diameter two
- Largest planar graphs of diameter two and fixed maximum degree
- The degree-diameter problem for plane graphs with pentagonal faces
- B-coloring of \(\mathcal{MP}_2\)-graphs
- Strong embedding of HP-graphs on surface with higher genus
This page was built for publication: Maximal planar graphs of diameter two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3480075)
