Amalgamations of almost regular edge-colourings of simple graphs

DOI10.1016/0095-8956(87)90008-6zbMath0654.05031MaRDI QIDQ1108284

C. St. J. A. Nash-Williams

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

zbMATH Keywords

detachment; vertex splitting; almost regular graphs

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

05C45: Eulerian and Hamiltonian graphs

Related Items

Amalgamated Factorizations of Complete Graphs, Amalgamations of factorizations of complete graphs, On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs, The embedding of partial triple systems when 4 divides \(\lambda\), Outline symmetric Latin squares, Amalgamations of connected \(k\)-factorizations., Hamiltonian double Latin squares, Fractional latin squares, simplex algebras, and generalized quotients, Amalgamating infinite Latin squares, Fair Hamilton decompositions of complete multipartite graphs, Amalgamations of factorizations of complete equipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Hamiltonian decompositions of complete graphs
• Hamiltonian decompositions of complete regular s-partite graphs
• The edge-coloring of complete hypergraphs. I
• Connected Detachments of Graphs and Generalized Euler Trails