Disjoint cycles with partial degree conditions in claw-free graphs
From MaRDI portal
Publication:2099484
DOI10.1016/j.disc.2022.113248zbMath1504.05153OpenAlexW4309576287MaRDI QIDQ2099484
Publication date: 23 November 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2022.113248
Paths and cycles (05C38) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Cycles through specified vertices
- On circuits in graphs
- Claw-free graphs---a survey
- Disjoint cliques in claw-free graphs
- Minimum degree and disjoint cycles in generalized claw-free graphs
- Minimum Degree and Disjoint Cycles in Claw-Free Graphs
- Note on Hamilton Circuits
- Degree conditions for 2-factors
- Partial Degree Conditions and Cycle Coverings
- On the maximal number of independent circuits in a graph
- Some Theorems on Abstract Graphs
This page was built for publication: Disjoint cycles with partial degree conditions in claw-free graphs