Four-cycle systems with two-regular leaves
From MaRDI portal
Publication:5952383
DOI10.1007/PL00013411zbMATH Open1010.05041OpenAlexW1965494169MaRDI QIDQ5952383FDOQ5952383
Authors: Hung-Lin Fu, C. A. Rodger 
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
Recommendations
- Super-simple twofold 4-cycle systems
- 2-regular leaves of partial 8-cycle systems
- Configurations in 4-cycle systems
- All 2-regular leaves of partial 6-cycle systems.
- Forest leaves and four-cycles
- scientific article; zbMATH DE number 2061964
- All nearly 2-regular leaves of partial 6-cycle systems
- Irreducible 2‐fold cycle systems
- Almost resolvable 4-cycle systems
- scientific article; zbMATH DE number 398959
Cited In (8)
- Decomposing graphs of high minimum degree into 4-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}\)
- Configurations in 4-cycle systems
- Forest leaves and four-cycles
- 4-cycle systems of \(K_n-E(F^\ast)\)
- All graphs with maximum degree three whose complements have 4-cycle decompositions
- Super-simple twofold 4-cycle systems
- A solution to the forest leave problem for partial 6-cycle systems
This page was built for publication: Four-cycle systems with two-regular leaves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952383)
