Fan-type condition on disjoint cycles in a graph

DOI10.1016/j.disc.2017.09.027zbMath1380.05111OpenAlexW2767587315MaRDI QIDQ1699571

Jin Yan, Shaohua Zhang, Jun-qing Cai

Publication date: 23 February 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2017.09.027

zbMATH Keywords

degree conditionFan-type conditiondisjoint cycle

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (9)

Degree sum conditions on two disjoint cycles in graphs ⋮ The confirmation of a conjecture on disjoint cycles in a graph ⋮ Lichiardopol's conjecture on disjoint cycles in tournaments ⋮ Degree conditions on copies of forests in graphs ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ An improvement of Lichiardopol's theorem on disjoint cycles in tournaments ⋮ A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs ⋮ Long paths in bipartite graphs and path-bistar bipartite Ramsey numbers ⋮ Disjoint cycles and \(2\)-factors with Fan-type condition in a graph

Cites Work

• Unnamed Item
• Proof of the Erdős-Faudree conjecture on quadrilaterals
• On circuits in graphs
• New sufficient conditions for cycles in graphs
• On the maximum number of independent cycles in a graph
• On the existence of disjoint cycles in a graph
• Vertex-disjoint cycles of the same length.
• 2-factors in dense graphs
• Graphs containing every 2-factor
• Disjoint cycles in graphs with distance degree sum conditions
• Embedding Arbitrary Graphs of Maximum Degree Two
• On the maximal number of independent circuits in a graph
• Disjoint triangles and quadrilaterals in a graph

This page was built for publication: Fan-type condition on disjoint cycles in a graph