Structure and pancyclicity of maximal planar graphs with diameter two
From MaRDI portal
Publication:2075455
DOI10.1007/s10878-021-00749-7zbMath1485.90106OpenAlexW3159184123MaRDI QIDQ2075455
Publication date: 14 February 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-021-00749-7
Related Items (1)
Cites Work
- Largest planar graphs of diameter two and fixed maximum degree
- The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
- A theorem on graphs
- 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
- On the vertex arboricity of planar graphs of diameter two
- A Theorem on Planar Graphs
- Maximal planar graphs of diameter two
- On the number of cycles of lengthk in a maximal planar graph
- Domination numbers of planar graphs
This page was built for publication: Structure and pancyclicity of maximal planar graphs with diameter two