Disjoint cycles with partial degree conditions in claw-free graphs
From MaRDI portal
Publication:2099484
DOI10.1016/J.DISC.2022.113248zbMATH Open1504.05153OpenAlexW4309576287MaRDI QIDQ2099484FDOQ2099484
Authors: Yuzhen Qi, Yun Wang, Jin Yan
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
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Vertex degrees (05C07) Paths and cycles (05C38)
Cites Work
- On the maximal number of independent circuits in a graph
- Claw-free graphs---a survey
- Note on Hamilton Circuits
- Some Theorems on Abstract Graphs
- Cycles through specified vertices
- On circuits in graphs
- Minimum degree and disjoint cycles in generalized claw-free graphs
- Minimum degree and disjoint cycles in claw-free graphs
- Degree conditions for 2-factors
- Disjoint cliques in claw-free graphs
- Partial Degree Conditions and Cycle Coverings
Cited In (4)
This page was built for publication: Disjoint cycles with partial degree conditions in claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2099484)