Forest leaves and four-cycles

DOI<161::AID-JGT6>3.0.CO;2-Q 10.1002/(SICI)1097-0118(200003)33:3<161::AID-JGT6>3.0.CO;2-QzbMath0946.05050OpenAlexW4250130009MaRDI QIDQ4948511

C. A. Rodger, Hung-Lin Fu

Publication date: 11 April 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(200003)33:3<161::aid-jgt6>3.0.co;2-q

zbMATH Keywords

partitiondecompositioncycleforestgraph factor

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

All graphs with maximum degree three whose complements have 4-cycle decompositions ⋮ Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs ⋮ A solution to the forest leave problem for partial 6-cycle systems

Cites Work

• Quadratic leaves of maximal partial triple systems
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Four-cycle systems with two-regular leaves
• Unnamed Item

This page was built for publication: Forest leaves and four-cycles