Hamiltonicity of 4-connected line graph of a planar graph

MaRDI QIDQ5193693zbMATH OpenFDO

Authors Maoqun Wang, Weihua Yang

Publication date 20 September 2019

zbMATH Keywords

2-Hamiltonian graphHamiltonian-connectedline graphplanar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• On s-Hamiltonian line graphs
• On \(s\)-Hamiltonian-connected line graphs
• Hamilton cycles in 5-connected line graphs
• Every 4-connected line graph of a planar graph is Hamiltonian
• On \(s\)-Hamiltonian line graphs of claw-free graphs

Cited in

(8)

• 4-connected projective planar graphs are Hamiltonian
• Every 4-connected line graph of a planar graph is Hamiltonian
• On \(s\)-Hamiltonian line graphs of claw-free graphs
• Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected
• On s-Hamiltonian line graphs
• Planar Hypohamiltonian Graphs on 40 Vertices
• The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
• scientific article; zbMATH DE number 866659 (Why is no real title available?)

This page was built for publication: Hamiltonicity of 4-connected line graph of a planar graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5193693)