A longest cycle version of Tutte's wheels theorem

DOI10.1006/JCTB.1997.1720zbMATH Open0883.05086OpenAlexW2032126408MaRDI QIDQ1369899FDOQ1369899

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

Recommendations

• Extensions of Tutte's wheels-and-whirls theorem
• scientific article; zbMATH DE number 1355271
• scientific article
• A theorem on cycle-wheel Ramsey number
• Longest cycles in certain bipartite graphs
• On a conjecture of Grünbaum on longest cycles
• A new proof of a theorem on long cycles
• scientific article; zbMATH DE number 3979098
• On the length of longest chordless cycles
• scientific article; zbMATH DE number 3875324

zbMATH Keywords

longest cycle3-connected graphnon-essential edge

Mathematics Subject Classification ID

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

Cites Work

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

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

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