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

zbMATH Open1093.05035MaRDI QIDQ5474635FDOQ5474635

Kyo Fujita

Publication date: 26 June 2006

Mathematics Subject Classification ID

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

Cited In (7)

• Title not available (Why is that?)
• Cyclic coloration of 3-polytopes
• Title not available (Why is that?)
• Contractible edges in longest cycles
• Title not available (Why is that?)
• Longest cycles in 3-connected graphs contain three contractible edges
• Contractible edges and longest cycles in 3-connected graphs

   Recommendations

• Longest cycles in 3-connected graphs contain three contractible edges 👍 👎
• Title not available (Why is that?) 👍 👎
• Contractible edges in longest cycles 👍 👎
• Contractible edges in longest cycles in non-Hamiltonian graphs 👍 👎
• 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)