Covering vertices by a specified number of disjoint cycles, edges and isolated vertices

DOI10.1016/J.DISC.2012.10.010zbMath1257.05126OpenAlexW2075712189MaRDI QIDQ1928447

Shuya Chiba, Shinya Fujita

Publication date: 3 January 2013

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

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

zbMATH Keywords

degree conditiondisjoint cyclescovering problem

Mathematics Subject Classification ID

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

Related Items (3)

Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ A complexity and approximation framework for the maximization scaffolding problem

This page was built for publication: Covering vertices by a specified number of disjoint cycles, edges and isolated vertices