On A Particular Conference Scheduling Problem

DOI10.1080/03155986.1975.11731616MaRDI QIDQ4123071zbMATH OpenOpenAlexFDO

Authors Dominique De Werra

Publication date 1975

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.1975.11731616

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cited in

(18)

• Hamiltonian decompositions of complete regular s-partite graphs
• Embedding partial triple systems
• On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs
• Generalized latin rectangles I: Construction and decomposition
• Construction of university faculty timetables using logic programming techniques
• Multigraphs with quasiweak odd cycles
• A vertex-splitting lemma, de Werra's theorem and improper list colourings
• Constructing day-balanced round-robin tournaments with partitions
• Internally fair factorizations and internally fair holey factorizations with prescribed regularity
• Multiply balanced edge colorings of multigraphs
• On the use of alternating chains and hypergraphs in edge coloring
• Compactness and balancing in scheduling
• Detachments of amalgamated 3-uniform hypergraphs: factorization consequences
• On evenly-equitable, balanced edge-colorings and related notions
• Total colorings of complete multipartite graphs using amalgamations
• A conjecture on rainbow Hamiltonian cycle decomposition
• Hamiltonian decompositions of complete graphs
• Degree-bounded factorizations of bipartite multigraphs and of pseudographs

This page was built for publication: On A Particular Conference Scheduling Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4123071)