Lower bound on the maximum number of contractible edges on longest cycles of a 3-connected graph

MaRDI QIDQ5474635zbMATH OpenFDO

Authors Kyo Fujita

Publication date 26 June 2006

Mathematics Subject Classification ID

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

Recommendations

• Longest cycles in 3-connected graphs contain three contractible edges
• scientific article; zbMATH DE number 2192176
• Contractible edges in longest cycles
• Contractible edges in longest cycles in non-Hamiltonian graphs
• Contractible edges and longest cycles in 3-connected graphs

Cited in

(7)

• Cyclic coloration of 3-polytopes
• scientific article; zbMATH DE number 5583746 (Why is no real title available?)
• Contractible edges in subgraphs of 2-connected graphs
• Contractible edges in longest cycles
• scientific article; zbMATH DE number 1192984 (Why is no real title available?)
• Longest cycles in 3-connected graphs contain three contractible edges
• Contractible edges and longest cycles in 3-connected graphs

This page was built for publication: Lower bound on the maximum number of contractible edges on longest cycles of a 3-connected graph

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