Covering a subset with two cycles

zbMATH Open1344.05115MaRDI QIDQ2820191FDOQ2820191

Hong Wang

Publication date: 14 September 2016

Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://ajc.maths.uq.edu.au//pdf/65/ajc_v65_p027.pdf

Recommendations

• Partial Degree Conditions and Cycle Coverings
• Covering vertices by a specified number of disjoint cycles, edges and isolated vertices
• Covering vertices of a graph by \(k\) disjoint cycles
• Partial degree conditions and cycle coverings in bipartite graphs
• Covering the vertices of a graph by cycles of prescribed length

Mathematics Subject Classification ID

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

Cited In (3)

• Degree sum conditions on two disjoint cycles in graphs
• An Ore-type condition for the existence of two disjoint cycles
• Resolvable coverings of 2-paths by cycles

This page was built for publication: Covering a subset with two cycles

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