Longest cycles in triangle-free graphs

DOI10.1016/0095-8956(89)90018-XzbMath0634.05046MaRDI QIDQ1096647

Min Aung

Publication date: 1988

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

zbMATH Keywords

bipartite graphlongest cyclelong cycledominating cycletriangle- free graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (7)

Connectivity, traceability and Hamiltonicity ⋮ \(D_ \lambda\)-cycles in 3-cyclable graphs ⋮ Maximal sets of Hamilton cycles inKn,n ⋮ Edge degrees and dominating cycles ⋮ Spanning paths and cycles in triangle-free graphs ⋮ Relative length of longest paths and longest cycles in triangle-free graphs ⋮ Long cycles in triangle-free graphs with prescribed independence number and connectivity

Cites Work

• Unnamed Item
• Unnamed Item
• Existence of Dlambda-cycles and Dlambda-paths
• Longest paths joining given vertices in a graph
• A sufficient condition for dominating cycles
• Existence of dominating cycles and paths

This page was built for publication: Longest cycles in triangle-free graphs