scientific article; zbMATH DE number 1996256

MaRDI QIDQ4432216zbMATH OpenFDO

Authors Lars Døvling Andersen, C. A. Rodger

Publication date 14 January 2004

zbMATH Keywords

amalgamationcomplete graphdecompositionedge-colouring

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of k_kn+1
• Cycle decompositions of complete graphs
• scientific article; zbMATH DE number 25257
• scientific article; zbMATH DE number 3505018
• Embedding an edge-colored \(K(a^{(p)};\lambda,\mu)\) into a Hamiltonian decomposition of \(K(a^{(p+r)};\lambda,\mu)\)

Cited in

(11)

• Amalgamations of almost regular edge-colourings of simple graphs
• Hamilton path decompositions of complete multipartite graphs
• Finite homogeneous metric spaces
• Total-colorings of complete multipartite graphs using amalgamations
• Embedding an edge-colored \(K(a^{(p)};\lambda,\mu)\) into a Hamiltonian decomposition of \(K(a^{(p+r)};\lambda,\mu)\)
• Almost regular edge colorings and regular decompositions of complete graphs
• Detachments of amalgamated 3-uniform hypergraphs: factorization consequences
• Switching techniques for edge decompositions of graphs
• Small embeddings for partial triple systems of odd index
• On almost-regular edge colourings of hypergraphs
• Maximal sets of Hamilton cycles in \(K_{2p}-F\)

This page was built for publication:

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