Long cycles in graphs with no subgraphs of minimal degree 3

DOI10.1016/0012-365X(89)90077-0zbMATH Open0676.05051OpenAlexW1984046014MaRDI QIDQ1122589FDOQ1122589

Authors: Béla Bollobás, Graham 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

Recommendations

• Long cycles in critical graphs
• scientific article; zbMATH DE number 426167
• scientific article; zbMATH DE number 565968
• Cycle lengths in graphs with large minimum degree
• Color-critical graphs have logarithmic circumference

zbMATH Keywords

longest cycledegree k-critical graphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)

Cited In (10)

• Long cycles and 3-connected spanning subgraphs of bounded degree in 3- connected \(K_{1,d}\)-free graphs
• On approximating the \(d\)-girth of a graph
• Color-critical graphs have logarithmic circumference
• On Approximating the d-Girth of a Graph
• Minimum k‐cores and the k‐core polytope
• Minimum degree of 3-graphs without long linear paths
• Graphs without proper subgraphs of minimum degree 3 and short cycles
• Parameterized complexity of finding small degree-constrained subgraphs
• On the approximability of some degree-constrained subgraph problems
• Minimum degree and density of binary sequences

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

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