On some conjectures on cubic 3-connected graphs

DOI10.1016/0012-365X(90)90294-RzbMath0702.05051OpenAlexW1999108567WikidataQ123196147 ScholiaQ123196147MaRDI QIDQ914697

Henri Thuillier, Jean-Luc Fouquet

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90294-r

zbMATH Keywords

cycleHamiltoniancubic 3-connected graphscubic cyclically 4-edge connected graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items (2)

Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs ⋮ How many conjectures can you stand? A survey

Cites Work

• Hamiltonian cycles in cubic 3-connected bipartite planar graphs
• Even cycles with prescribed chords in planar cubic graphs
• On Hamiltonian Circuits
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On some conjectures on cubic 3-connected graphs