The confirmation of a conjecture on disjoint cycles in a graph
From MaRDI portal
Publication:1660280
DOI10.1016/j.disc.2018.07.003zbMath1393.05167arXiv1707.02390OpenAlexW2963116645WikidataQ123024034 ScholiaQ123024034MaRDI QIDQ1660280
Publication date: 15 August 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.02390
Related Items
On degree sum conditions and vertex-disjoint chorded cycles, Lichiardopol's conjecture on disjoint cycles in tournaments, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, An improvement of Lichiardopol's theorem on disjoint cycles in tournaments, Disjoint cycles and \(2\)-factors with Fan-type condition in a graph, Results and problems on chorded cycles: a survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph partition into small cliques
- On Enomoto's problems in a bipartite graph
- On the maximal number of independent triangles in graphs
- On the maximum number of independent cycles in a graph
- On the existence of disjoint cycles in a graph
- Fan-type condition on disjoint cycles in a graph
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- On the maximum number of independent cycles in a bipartite graph
- Disjoint cycles in graphs with distance degree sum conditions
- On vertex-disjoint cycles and degree sum conditions
- Degree conditions for 2-factors
- On the maximal number of independent circuits in a graph