Decomposing dense bipartite graphs into 4-cycles

zbMath1308.05088MaRDI QIDQ2260624

Nicholas J. Cavenagh

Publication date: 11 March 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i1p50

zbMATH Keywords

graph decompositionextremal graph theory

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)

Cites Work

• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Packing closed trails into dense graphs.
• Decompositions of complete multipartite graphs into cycles of even length
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
• The decomposition threshold for bipartite graphs with minimum degree one
• Decomposing Graphs of High Minimum Degree into 4‐Cycles
• List decomposition of graphs.
• Unnamed Item
• Unnamed Item
• Unnamed Item