Degree sum conditions for vertex-disjoint cycles passing through specified vertices

DOI10.1016/j.disc.2016.12.010zbMath1355.05195OpenAlexW2567763580MaRDI QIDQ507488

Shuya Chiba, Tomoki Yamashita

Publication date: 6 February 2017

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

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

zbMATH Keywords

partitionsvertex-disjoint cyclesdegree conditionsspecified vertex subsets

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Degree conditions for the existence of vertex-disjoint cycles and paths: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Improved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphs
• Small cycles and 2-factor passing through any given vertices in graphs
• Cycles in 2-factors of balanced bipartite graphs
• Vertex-disjoint cycles containing specified edges
• On 2-factors of a bipartite graph
• Degree conditions for 2-factors
• Graph partition problems into cycles and paths
• A degree condition of 2-factors in bipartite graphs

This page was built for publication: Degree sum conditions for vertex-disjoint cycles passing through specified vertices