On A Particular Conference Scheduling Problem
From MaRDI portal
Publication:4123071
DOI10.1080/03155986.1975.11731616zbMath0352.90032OpenAlexW213068804MaRDI QIDQ4123071
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
Extremal problems in graph theory (05C35) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15)
Related Items (16)
Hamiltonian decompositions of complete regular s-partite graphs ⋮ Multiply balanced edge colorings of multigraphs ⋮ A vertex-splitting lemma, de Werra's theorem and improper list colourings ⋮ Embedding partial triple systems ⋮ Internally fair factorizations and internally fair holey factorizations with prescribed regularity ⋮ On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs ⋮ Constructing day-balanced round-robin tournaments with partitions ⋮ Generalized latin rectangles I: Construction and decomposition ⋮ Construction of university faculty timetables using logic programming techniques ⋮ On evenly-equitable, balanced edge-colorings and related notions ⋮ Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences ⋮ Degree-bounded factorizations of bipartite multigraphs and of pseudographs ⋮ Compactness and balancing in scheduling ⋮ On the use of alternating chains and hypergraphs in edge coloring ⋮ Multigraphs with quasiweak odd cycles ⋮ Hamiltonian decompositions of complete graphs
This page was built for publication: On A Particular Conference Scheduling Problem
