Classes of cubic graphs containing cycles of integer-power lengths
From MaRDI portal
Recommendations
Cites work
- A refinement of Kuratowski's theorem
- Almost claw‐free graphs
- Claw-free graphs---a survey
- Cycle lengths in sparse graphs
- Erdős-Gyárfás conjecture for cubic planar graphs
- Graph theory with applications
- scientific article; zbMATH DE number 1735729 (Why is no real title available?)
- scientific article; zbMATH DE number 1151859 (Why is no real title available?)
- scientific article; zbMATH DE number 1990718 (Why is no real title available?)
- On \(q\)-power cycles in cubic graphs
- On the Erdős-Gyárfás conjecture in claw-free graphs
- Some old and new problems in various branches of combinatorics
- Unavoidable cycle lengths in graphs
Cited in
(5)
This page was built for publication: Classes of cubic graphs containing cycles of integer-power lengths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4990108)