All graphs with maximum degree three whose complements have 4-cycle decompositions

DOI10.1016/j.disc.2007.07.082zbMath1171.05011OpenAlexW2027281727MaRDI QIDQ924981

Chin-Mei Fu, C. A. Rodger, Todd B. Smith, Hung-Lin Fu

Publication date: 29 May 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.082

zbMATH Keywords

graph decomposition4-cycle3-regular

Mathematics Subject Classification ID

Paths and cycles (05C38) Other designs, configurations (05B30)

Related Items (3)

\(\vec C_4\)-decompositions of \(D_v\backslash P\) and \(D_{v}\cup P\) where \(P\) is a 2-regular subgraph of \(D_{v}\) ⋮ 4-cycle systems of \(K_n-E(F^\ast)\) ⋮ Decomposing Graphs of High Minimum Degree into 4‐Cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamilton decomposable graphs with specified leaves
• Neighbor designs and m-wheel systems
• Quadratic leaves of maximal partial triple systems
• Sampling plans excluding contiguous units
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• A solution to the forest leave problem for partial 6-cycle systems
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Cycle decompositions III: Complete graphs and fixed length cycles
• TWO-DIMENSIONAL BALANCED SAMPLING PLANS EXCLUDING CONTIGUOUS UNITS
• Hamilton cycle rich two-factorizations of complete graphs
• Forest leaves and four-cycles
• Four-cycle systems with two-regular leaves

This page was built for publication: All graphs with maximum degree three whose complements have 4-cycle decompositions