Disjoint 5-cycles in a graph

DOI10.7151/dmgt.1605zbMath1255.05109OpenAlexW1966080659MaRDI QIDQ4647864

Hong Wang

Publication date: 8 November 2012

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6562c9f2be6be5b58d6006c1a64bd63e12796568

zbMATH Keywords

cyclescycle coveringspentagons5-cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (5)

Cycles of Given Size in a Dense Graph ⋮ A greedy algorithm for the social golfer and the Oberwolfach problem ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Covering and tiling hypergraphs with tight cycles ⋮ Unnamed Item

This page was built for publication: Disjoint 5-cycles in a graph