Disjoint 5-cycles in a graph

DOI10.7151/DMGT.1605MaRDI QIDQ4647864zbMATH OpenOpenAlexFDO

Authors 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

5-cyclescycle coveringscyclespentagons

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)

Recommendations

• Disjoint cycles of order at least 5
• scientific article; zbMATH DE number 6010662
• Disjoint long cycles in a graph
• Vertex-disjoint cycles of the same length.
• Disjoint cycles with prescribed lengths and independent edges in graphs

Cited in

(13)

• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Disjoint long cycles in a graph
• A greedy algorithm for the social golfer and the Oberwolfach problem
• scientific article; zbMATH DE number 6010662 (Why is no real title available?)
• Pentagons and cycle coverings
• Vertex-disjoint short cycles containing specified edges in a graph
• Cycles of Given Size in a Dense Graph
• Disjoint triangles and pentagons in a graph
• Disjoint cycles of order at least 5
• Covering and tiling hypergraphs with tight cycles
• Packing directed cycles of specified odd length into digraphs and alternating cycles into bipartite graphs
• Degree sum condition for vertex-disjoint 5-cycles
• Turán numbers for vertex-disjoint triangles and pentagons

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

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