Decomposing Graphs of High Minimum Degree into 4‐Cycles

DOI10.1002/JGT.21816zbMATH Open1317.05146OpenAlexW1962377590MaRDI QIDQ5265328FDOQ5265328

Darryn 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) Vertex degrees (05C07) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

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

Cited In (4)

• 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

This page was built for publication: Decomposing Graphs of High Minimum Degree into 4‐Cycles

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