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

DOI10.1016/J.DISC.2012.10.010MaRDI QIDQ1928447zbMATH OpenOpenAlexFDO

Authors 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

covering problemdegree conditiondisjoint cycles

Mathematics Subject Classification ID

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

Recommendations

• Covering vertices of a graph by \(k\) disjoint cycles
• scientific article; zbMATH DE number 1471073
• Cycles and degenerate cycles through specified vertices
• Covering a subset with two cycles
• k disjoint cycles containing specified independent vertices

Cited in

(6)

• Covering vertices of a graph by \(k\) disjoint cycles
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• A complexity and approximation framework for the maximization scaffolding problem
• Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles
• Covering a subset with two cycles
• Graphs without two vertex-disjoint S-cycles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928447)