Disjoint cycles and \(2\)-factors with Fan-type condition in a graph
From MaRDI portal
Publication:2075536
DOI10.1016/j.disc.2021.112789zbMath1484.05113MaRDI QIDQ2075536
Publication date: 14 February 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2021.112789
Cites Work
- Improved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphs
- 2-factors with \(k\) cycles in Hamiltonian graphs
- Girth in graphs
- New sufficient conditions for cycles in graphs
- On 2-factors with \(k\) components
- Degree conditions for the partition of a graph into cycles, edges and isolated vertices
- On the maximum number of independent cycles in a graph
- Vertex-disjoint cycles of the same length.
- The confirmation of a conjecture on disjoint cycles in a graph
- On degree sum conditions for 2-factors with a prescribed number of cycles
- Fan-type condition on disjoint cycles in a graph
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Vertex-disjoint cycles of the same length
- Disjoint cycles in graphs with distance degree sum conditions
- On vertex-disjoint cycles and degree sum conditions
- Note on Hamilton Circuits
- A Conjecture of Verstraëte on Vertex-Disjoint Cycles
- A Note on Vertex-Disjoint Cycles
- Degree conditions for 2-factors
- On the maximal number of independent circuits in a graph
- Some Theorems on Abstract Graphs
- Unnamed Item
- Unnamed Item