Four-cycle systems with two-regular leaves

DOI10.1007/PL00013411zbMath1010.05041OpenAlexW1965494169MaRDI QIDQ5952383

C. A. Rodger, Hung-Lin Fu

Publication date: 9 January 2002

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00013411

zbMATH Keywords

existence problem

Mathematics Subject Classification ID

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

Related Items (6)

Forest leaves and four-cycles ⋮ \(\vec C_4\)-decompositions of \(D_v\backslash P\) and \(D_{v}\cup P\) where \(P\) is a 2-regular subgraph of \(D_{v}\) ⋮ All graphs with maximum degree three whose complements have 4-cycle decompositions ⋮ 4-cycle systems of \(K_n-E(F^\ast)\) ⋮ A solution to the forest leave problem for partial 6-cycle systems ⋮ Decomposing Graphs of High Minimum Degree into 4‐Cycles

This page was built for publication: Four-cycle systems with two-regular leaves