Intersections of longest cycles in \(k\)-connected graphs

DOI10.1006/jctb.1997.1802zbMath0897.05056OpenAlexW2064766945MaRDI QIDQ1386428

Guantao Chen, Ronald J. Gould, Ralph J. Faudree

Publication date: 19 October 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.1802

zbMATH Keywords

connected graphlongest cycles

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (6)

Circumferences of k-connected graphs involving independence numbers ⋮ Improvements on Hippchen's conjecture ⋮ Transversals of longest cycles in partial k‐trees and chordal graphs ⋮ The longest cycle problem is polynomial on interval graphs ⋮ Intersections of largest bonds in \(k\)-connected graphs ⋮ Intersections of cycles in \(k\)-connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Long cycles in vertex-transitive graphs
• A polynomial algorithm for the max-cut problem on graphs without long odd cycles
• Connectivity of transitive graphs
• Some Theorems on Abstract Graphs
• Eine Eigenschaft der Atome endlicher Graphen

This page was built for publication: Intersections of longest cycles in \(k\)-connected graphs