Contractible edges in longest cycles

DOI10.1002/JGT.22935zbMATH Open1522.05235OpenAlexW4321375623MaRDI QIDQ6074596FDOQ6074596

Authors: Tsz Lung Chan, Matthias Kriesell, Jens M. Schmidt 

Publication date: 12 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22935

Recommendations

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

zbMATH Keywords

triangle-freelongest cycle\(k\)-connected graphcontractible edge

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Paths and cycles (05C38) Connectivity (05C40)

Cites Work

• Graph theory
• Generalizaions of critical connectivity of graphs
• Title not available (Why is that?)
• Topics in structural graph theory
• Nonseparating cycles inK-Connected graphs
• A survey on contractible edges in graphs of a prescribed vertex connectivity
• Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4]\)
• Average degree and contractibility
• Distribution of contractible edges in k-connected graphs
• Contractible edges in triangle-free graphs
• Title not available (Why is that?)
• Contractible edges in longest cycles in non-Hamiltonian graphs
• Longest cycles in 3-connected graphs contain three contractible edges
• The 3‐connected graphs having a longest cycle containing only three contractible edges
• Title not available (Why is that?)
• The 3‐connected graphs with a maximum matching containing precisely one contractible edge
• More on foxes
• Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge
• Classification of Hamiltonian cycles of a 3-connected graph which contain five contractible edges
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lower bound on the maximum number of contractible edges on longest cycles of a 3-connected graph

Cited In (5)

• Contractible cycles in graphs with girth at least 5
• A longest cycle and contractible edges
• Contractible edges in longest cycles in non-Hamiltonian graphs
• Lower bound on the maximum number of contractible edges on longest cycles of a 3-connected graph
• On the number of contractible edges of longest cycles in \(k\)-connected graphs

This page was built for publication: Contractible edges in longest cycles

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