scientific article; zbMATH DE number 3491001

zbMATH Open0314.05104MaRDI QIDQ4073396FDOQ4073396

Authors: Dominique De Werra 

Publication date: 1975

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (14)

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

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)