scientific article; zbMATH DE number 3491001

MaRDI QIDQ4073396zbMATH OpenFDO

Authors Dominique De Werra

Publication date 1975

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Cited in

(15)

• Hamiltonian decompositions of complete regular s-partite graphs
• Data transfers in networks
• Generalized latin rectangles I: Construction and decomposition
• Outline symmetric Latin squares
• The edge-coloring of complete hypergraphs. I
• A vertex-splitting lemma, de Werra's theorem and improper list colourings
• Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations
• Constructing day-balanced round-robin tournaments with partitions
• Augmented quasigroups and character algebras
• Multiply balanced edge colorings of multigraphs
• Total colorings of complete multipartite graphs using amalgamations
• A conjecture on rainbow Hamiltonian cycle decomposition
• An introduction to timetabling
• Hamiltonian decompositions of complete graphs
• Degree-bounded factorizations of bipartite multigraphs and of pseudographs

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 Q4073396)