Maximum cyclic 4-cycle packings of the complete multipartite graph

DOI10.1007/S10878-007-9048-6MaRDI QIDQ2471047zbMATH OpenOpenAlexFDO

Authors Shung-Liang Wu, Hung-Lin Fu

Publication date 18 February 2008

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-007-9048-6

zbMATH Keywords

4-cyclecomplete multipartite graphcycle packingcycle systemcyclic

Mathematics Subject Classification ID

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

Recommendations

• Packing complete multipartite graphs with 4-cycles
• Packing and covering the balanced complete bipartite multigraph with cycles and stars
• Decompositions of complete multipartite graphs into cycles of even length
• Packing \(\lambda\)-fold complete multipartite graphs with 4-cycles
• Equipartite and almost-equipartite gregarious 4-cycle systems

Cites work

• Cycle decompositions of K_n and K_n-I
• Cycle decompositions. III: Complete graphs and fixed length cycles.
• Cyclic Hamiltonian cycle systems of the complete graph.
• Cyclically decomposing the complete graph into cycles
• Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
• Cyclicm-cycle systems withm ≤ 32 orm = 2q withq a prime power
• Decomposing complete tripartite graphs into cycles of lengths 3 and 4
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Decompositions of complete multipartite graphs into cycles of even length
• Existence of 1-rotational \(k\)-cycle systems of the complete graph
• Existence of cyclic \(k\)-cycle systems of the complete graph
• Further decompositions of complete tripartite graphs into 5-cycles
• scientific article; zbMATH DE number 1229616 (Why is no real title available?)
• scientific article; zbMATH DE number 1556758 (Why is no real title available?)
• scientific article; zbMATH DE number 828005 (Why is no real title available?)
• scientific article; zbMATH DE number 3218576 (Why is no real title available?)
• scientific article; zbMATH DE number 2192081 (Why is no real title available?)
• scientific article; zbMATH DE number 3238443 (Why is no real title available?)
• scientific article; zbMATH DE number 3031875 (Why is no real title available?)
• Maximum packings of uniform group divisible triple systems
• Minimizing drop cost for SONET/WDM networks with 18 wavelength requirements
• On the construction of odd cycle systems
• On the cyclic decompositions of the complete graph into polygons with odd number of edges
• Packing \(\lambda\)-fold complete multipartite graphs with 4-cycles
• Packing complete multipartite graphs with 4-cycles
• Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
• Skolem-type difference sets for cycle systems
• The Existence of 2×4 Grid-Block Designs and Their Applications

Cited in

(6)

• Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs
• Packings and coverings of various complete graphs with the 4-cycle with a pendant edge
• Packing complete multipartite graphs with 4-cycles
• C₄-frames of M(b,n)
• On maximum cycle packings in polyhedral graphs
• A note on cyclic \(m\)-cycle systems of \(K_{r(m)}\)

This page was built for publication: Maximum cyclic 4-cycle packings of the complete multipartite graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2471047)