Long cycles in graphs with no subgraphs of minimal degree 3

DOI10.1016/0012-365X(89)90077-0zbMath0676.05051OpenAlexW1984046014MaRDI QIDQ1122589

Béla Bollobás, Graham R. Brightwell

Publication date: 1989

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(89)90077-0

zbMATH Keywords

longest cycledegree k-critical graphs

Mathematics Subject Classification ID

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

Related Items (7)

Minimum k‐cores and the k‐core polytope ⋮ Parameterized complexity of finding small degree-constrained subgraphs ⋮ On the approximability of some degree-constrained subgraph problems ⋮ On approximating the \(d\)-girth of a graph ⋮ Graphs without proper subgraphs of minimum degree 3 and short cycles ⋮ Minimum degree and density of binary sequences ⋮ On Approximating the d-Girth of a Graph

Cites Work

• Unnamed Item

This page was built for publication: Long cycles in graphs with no subgraphs of minimal degree 3