A longest cycle version of Tutte's wheels theorem

DOI10.1006/JCTB.1997.1720zbMath0883.05086OpenAlexW2032126408MaRDI QIDQ1369899

Talmage James Reid, Haidong Wu

Publication date: 22 February 1998

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1997.1720

zbMATH Keywords

3-connected graphlongest cyclenon-essential edge

Mathematics Subject Classification ID

Paths and cycles (05C38) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Contractible edges in 3-connected graphs
• Planarity and duality of finite and infinite graphs
• Decomposition of regular matroids
• A characterization of 3-connected graphs containing a given graph
• Extensions of Tutte's wheels-and-whirls theorem
• Contractible edges in longest cycles in non-Hamiltonian graphs
• On contractible and vertically contractible elements in 3-connected matroids and graphs
• Matroids and graphs with few non-essential elements
• On the structure of 3-connected matroids and graphs
• The smallest rounded sets of binary matroids
• The 3-connected graphs with exactly three non-essential edges
• Longest cycles in 3-connected graphs contain three contractible edges
• The 3‐connected graphs having a longest cycle containing only three contractible edges
• The 3‐connected graphs with a maximum matching containing precisely one contractible edge
• Connectivity in Matroids

This page was built for publication: A longest cycle version of Tutte's wheels theorem