Contractible edges and longest cycles in 3-connected graphs

DOI10.1007/s00373-022-02609-5OpenAlexW4316805134MaRDI QIDQ2689121

Yoshimi Egawa, Shunsuke Nakamura

Publication date: 9 March 2023

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-022-02609-5

zbMATH Keywords

3-connected graphlongest cyclecontractible edge

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Contractible edges in longest cycles in non-Hamiltonian graphs
• Maximum number of contractible edges on Hamiltonian cycles of a 3-connected graph
• Graph Theory
• Longest cycles in 3-connected graphs contain three contractible edges
• The 3‐connected graphs having a longest cycle containing only three contractible edges
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Contractible edges and longest cycles in 3-connected graphs