Decomposing graphs of high minimum degree into 4-cycles
DOI10.1002/JGT.21816zbMATH Open1317.05146OpenAlexW1962377590MaRDI QIDQ5265328FDOQ5265328
Authors: 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
Recommendations
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
- Some Theorems on Abstract Graphs
- Über ein Problem von K. Zarankiewicz
- Title not available (Why is that?)
- 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 (7)
- Edge-decompositions of graphs with high minimum degree
- Edge-decompositions of graphs with high minimum degree
- Decomposing dense bipartite graphs into 4-cycles
- Decomposition of bounded degree graphs into \(C_4\)-free subgraphs
- On the exact decomposition threshold for even cycles
- On the decomposition threshold of a given graph
- All graphs with maximum degree three whose complements have 4-cycle decompositions
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)
