A degree condition for the circumference of a graph
From MaRDI portal
Publication:3835488
Recommendations
Cited in
(16)- scientific article; zbMATH DE number 1865919 (Why is no real title available?)
- The longest cycles in a graph G with minimum degree at least \(| G| /k\)
- A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture
- Degree bounds for the circumference of 3‐connected graphs
- Degree sum conditions for the circumference of 4-connected graphs
- Advanced lower bounds for the circumference
- scientific article; zbMATH DE number 270251 (Why is no real title available?)
- Circumference of a graph and its distance dominating longest cycles
- A degree condition for cycles passing through specified vertices and edges
- Degree sums for edges and cycle lengths in graphs
- The longest cycle of a graph with a large minimal degree
- A degree sum condition for long cycles passing through a linear forest
- scientific article; zbMATH DE number 4189767 (Why is no real title available?)
- scientific article; zbMATH DE number 146256 (Why is no real title available?)
- A degree condition for the circumference of a graph
- scientific article; zbMATH DE number 3557820 (Why is no real title available?)
This page was built for publication: A degree condition for the circumference of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3835488)