A degree sum condition for graphs to be covered by two cycles
From MaRDI portal
Publication:973109
DOI10.1016/j.disc.2010.02.017zbMath1222.05118OpenAlexW1984537817MaRDI QIDQ973109
Publication date: 28 May 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.02.017
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Hamilton connected graphs
- Long cycles in graphs without Hamiltonian paths
- Cycles in graphs with prescribed stability number and connectivity
- A note on Hamiltonian circuits
- Degree sums and graphs that are not covered by two cycles
- Neighborhood unions and the cycle cover number of a graph
- Relative length of long paths and cycles in graphs with large degree sums
- Degree Sums and Covering Cycles