On A Particular Conference Scheduling Problem
From MaRDI portal
Publication:4123071
DOI10.1080/03155986.1975.11731616zbMATH Open0352.90032OpenAlexW213068804MaRDI QIDQ4123071FDOQ4123071
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
Deterministic scheduling theory in operations research (90B35) Extremal problems in graph theory (05C35) Integer programming (90C10) Coloring of graphs and hypergraphs (05C15)
Cited In (17)
- Constructing day-balanced round-robin tournaments with partitions
- Compactness and balancing in scheduling
- Embedding partial triple systems
- Multiply balanced edge colorings of multigraphs
- On the use of alternating chains and hypergraphs in edge coloring
- Degree-bounded factorizations of bipartite multigraphs and of pseudographs
- On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs
- Multigraphs with quasiweak odd cycles
- Total colorings of complete multipartite graphs using amalgamations
- Construction of university faculty timetables using logic programming techniques
- Hamiltonian decompositions of complete graphs
- On evenly-equitable, balanced edge-colorings and related notions
- 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
- Internally fair factorizations and internally fair holey factorizations with prescribed regularity
- Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences
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)
