Decomposing Graphs of High Minimum Degree into 4‐Cycles

DOI10.1002/jgt.21816zbMath1317.05146OpenAlexW1962377590MaRDI QIDQ5265328

Darryn E. Bryant, Nicholas J. Cavenagh

Publication date: 23 July 2015

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://espace.library.uq.edu.au/view/UQ:342597/UQ342597_OA.pdf

zbMATH Keywords

graph decompositioncycle decomposition

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Related Items

Edge-decompositions of graphs with high minimum degree, Edge-decompositions of graphs with high minimum degree, Decomposing dense bipartite graphs into 4-cycles, On the decomposition threshold of a given graph

Cites Work

• Unnamed Item
• All graphs with maximum degree three whose complements have 4-cycle decompositions
• Quadratic leaves of maximal partial triple systems
• 1-factorizing regular graphs of high degree - an improved bound
• A method in graph theory
• Packing closed trails into dense graphs.
• Graphs without quadrilaterals
• Hamilton decompositions of regular expanders: applications
• Über ein Problem von K. Zarankiewicz
• Tree decomposition of graphs
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
• The decomposition threshold for bipartite graphs with minimum degree one
• Some Theorems on Abstract Graphs
• Four-cycle systems with two-regular leaves
• List decomposition of graphs.