scientific article; zbMATH DE number 874284

zbMATH Open0845.05059MaRDI QIDQ4876808FDOQ4876808

Authors: Kyo Fujita 

Publication date: 6 May 1996

Title of this publication is not available (Why is that?)

Recommendations

• The 3‐connected graphs having a longest cycle containing only three contractible edges
• Contractible edges and longest cycles in 3-connected graphs
• scientific article; zbMATH DE number 4043878
• A longest cycle and contractible edges
• scientific article; zbMATH DE number 786133

zbMATH Keywords

longest cyclehamiltonian cyclecontractible edges

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cited In (9)

• Hamiltonian cycles with six 3-contractible edges which have four consecutive nondegenerate segments
• Hamiltonian cycles with six 3-contractible edges which have three consecutive nondegenerate segments
• Title not available (Why is that?)
• Maximum number of contractible edges on Hamiltonian cycles of a 3-connected graph
• Contractible edges in longest cycles
• Longest cycles of a 3-connected graph which contain five contractible edges
• 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

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 Q4876808)