Amalgamations and Equitable Block-Colorings

DOI10.1007/978-981-13-0023-3_5zbMath1459.05271OpenAlexW2797755784MaRDI QIDQ5114854

C. A. Rodger, E. B. Matson

Publication date: 29 June 2020

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-981-13-0023-3_5

zbMATH Keywords

\(H\)-decomposition of a graph\((s, p)\)-equitable block-colorings

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Equitable block-colorings of \(C_4\)-decompositions of \(K_v-F\)
• Equitable specialized block-colourings for 4-cycle systems-I
• Hamiltonian decompositions of complete graphs
• Equitable specialized block-colourings for 4-cycle systems - II
• Equitable specialized block-colourings for Steiner triple systems
• Hamiltonian decompositions of complete regular s-partite graphs
• More extreme equitable colorings of decompositions of \(K_v\) and \(K_v - F\)
• Fair Hamilton decompositions of complete multipartite graphs
• Fair holey Hamiltonian decompositions of complete multipartite graphs and long cycle frames
• Fair 1-factorizations and fair holey 1-factorizations of complete multipartite graphs
• Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs
• Multiply balanced edge colorings of multigraphs
• Hamilton decompositions of complete multipartite graphs with any 2‐factor leave