Covering vertices of a graph by \(k\) disjoint cycles

DOI10.1016/S0012-365X(02)00831-2zbMath1030.05064OpenAlexW2062272196MaRDI QIDQ1406550

Yoshimi Egawa, Hong Wang, Mariko Hagita, Ken-ichi Kawarabayashi

Publication date: 4 September 2003

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00831-2

zbMATH Keywords

cover

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

Cycles of Given Size in a Dense Graph ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ A 2-factor with short cycles passing through specified independent vertices in graph ⋮ Filtered matchings and simplicial complexes ⋮ Packing disjoint cycles over vertex cuts ⋮ \(k\) disjoint cycles containing specified independent vertices ⋮ Covering the vertices of a graph with cycles of bounded length

Cites Work

• Unnamed Item
• Unnamed Item
• On circuits in graphs
• On the maximum number of independent cycles in a graph
• On the existence of disjoint cycles in a graph
• Two vertex-disjoint cycles in a graph
• On maximal paths and circuits of graphs
• Covering a graph with cycles
• On the maximal number of independent circuits in a graph

This page was built for publication: Covering vertices of a graph by \(k\) disjoint cycles