On the circumference of 3-connected cubic triangle-free plane graphs

DOI10.1155/2021/1593006zbMath1477.05095OpenAlexW3195108691MaRDI QIDQ2666403

Witthawas Phanthawimol, Adthasit Sinna, Sirirat Singhun

Publication date: 22 November 2021

Published in: Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2021/1593006

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
• Non-Hamiltonian cubic planar maps
• A note on 3-connected cubic planar graphs
• Longest cycles in 3-connected cubic graphs
• The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
• 4-connected projective planar graphs are Hamiltonian
• Five-connected toroidal graphs are Hamiltonian
• Circumference of 3-connected cubic graphs
• On some properties of DNA graphs
• A new extension to the controlled metric type spaces endowed with a graph
• A Theorem on Planar Graphs
• A closed -knight’s tour on some cylinder chessboards
• Polytopes, graphs, and complexes
• On Hamiltonian Circuits
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the circumference of 3-connected cubic triangle-free plane graphs