Structure and pancyclicity of maximal planar graphs with diameter two
From MaRDI portal
Publication:2075455
Recommendations
- Maximal planar graphs of diameter two
- Largest planar graphs and largest maximal planar graphs of diameter two
- Largest planar graphs of diameter two and fixed maximum degree
- The degree/diameter problem in maximal planar bipartite graphs
- The degree/diameter problem in maximal planar bipartite graphs
- On the maximum degree of path-pairable planar graphs
- On the maximum diameter of path-pairable graphs
- Large planar graphs with given diameter and maximum degree
- Total domination in planar graphs of diameter two
- Maximal and minimal vertex-critical graphs of diameter two
Cites work
- A theorem on graphs
- A Theorem on Planar Graphs
- Computation on the difference of Zagreb indices of maximal planar graphs with diameter two
- Domination numbers of planar graphs
- Largest planar graphs of diameter two and fixed maximum degree
- List coloring and diagonal coloring for plane graphs of diameter two
- Maximal planar graphs of diameter two
- On the number of cycles of lengthk in a maximal planar graph
- On the vertex arboricity of planar graphs of diameter two
- The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
Cited in
(3)
This page was built for publication: Structure and pancyclicity of maximal planar graphs with diameter two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2075455)
