scientific article; zbMATH DE number 866659

MaRDI QIDQ4873678zbMATH OpenFDO

Authors Curtiss Barefoot

Publication date 17 April 1996

zbMATH Keywords

connectivityHalin graphHamiltonian-connectedplane trees

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Hamiltonicity of 4-connected graphs
• 2-edge-Hamiltonian-connectedness of 4-connected plane graphs
• Every 4-connected graph with crossing number 2 is Hamiltonian
• 4-connected projective-planar graphs are Hamiltonian-connected
• 4-connected projective-planar graphs are Hamiltonian-connected
• 4-connected projective planar graphs are Hamiltonian
• A new proof that 4-connected planar graphs are Hamiltonian-connected
• Hamiltonicity of 4-connected line graph of a planar graph
• Every 4-connected line graph of a planar graph is Hamiltonian
• Hamiltonicity and forbidden subgraphs in 4‐connected graphs

Cited in

(4)

• Hamiltonicity of cubic 3-connected \(k\)-Halin graphs
• scientific article; zbMATH DE number 4059449 (Why is no real title available?)
• Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs
• A 3-approximation for the pathwidth of Halin graphs

This page was built for publication:

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