The longest cycles in a graph G with minimum degree at least \(| G| /k\)

DOI10.1016/0095-8956(89)90055-5zbMath0669.05043OpenAlexW2023290792MaRDI QIDQ1118613

Takashi Miyamoto, Yoshimi Egawa

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0095-8956(89)90055-5

zbMATH Keywords

cyclecircumference

Mathematics Subject Classification ID

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

Related Items (9)

Stability for vertex cycle covers ⋮ Length of longest cycles in a graph whose relative length is at least two ⋮ Spanning paths in graphs ⋮ Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs ⋮ Cycles through specified vertices ⋮ On removable circuits in graphs and matroids ⋮ Weakly pancyclic graphs ⋮ Trees through specified vertices ⋮ The Monochromatic Circumference of 2‐Edge‐Colored Graphs

Cites Work

• The longest cycle of a graph with a large minimal degree
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The longest cycles in a graph G with minimum degree at least \(| G| /k\)