Amalgamations of almost regular edge-colourings of simple graphs
From MaRDI portal
Publication:1108284
DOI10.1016/0095-8956(87)90008-6zbMath0654.05031OpenAlexW2030668644MaRDI QIDQ1108284
Publication date: 1987
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(87)90008-6
Related Items (22)
Amalgamations of factorizations of complete equipartite graphs ⋮ Multiply balanced edge colorings of multigraphs ⋮ Factorizations of complete multipartite hypergraphs ⋮ Detachments of Hypergraphs I: The Berge–Johnson Problem ⋮ Embedding an edge-colored \(K(a^{(p)};\lambda,\mu)\) into a Hamiltonian decomposition of \(K(a^{(p+r)};\lambda,\mu)\) ⋮ On completing partial Latin squares with prescribed diagonals ⋮ Amalgamated Factorizations of Complete Graphs ⋮ On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs ⋮ Amalgamations of factorizations of complete graphs ⋮ Connected Baranyai's theorem ⋮ Amalgamations of connected \(k\)-factorizations. ⋮ Hamiltonian double Latin squares ⋮ The embedding of partial triple systems when 4 divides \(\lambda\) ⋮ Outline symmetric Latin squares ⋮ Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences ⋮ Embedding Factorizations for 3-Uniform Hypergraphs ⋮ Antiparallel \(d\)-stable traces and a stronger version of ore problem ⋮ Amalgamating infinite Latin squares ⋮ On almost-regular edge colourings of hypergraphs ⋮ Fractional latin squares, simplex algebras, and generalized quotients ⋮ Enclosings of decompositions of complete multigraphs in 2-edge-connected \(r\)-factorizations ⋮ Fair Hamilton decompositions of complete multipartite graphs
Cites Work
This page was built for publication: Amalgamations of almost regular edge-colourings of simple graphs
