The Solution of a Timetabling Problem
From MaRDI portal
Publication:5655204
DOI10.1093/imamat/9.1.23zbMath0243.90046OpenAlexW2097849377MaRDI QIDQ5655204
Publication date: 1972
Published in: IMA Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imamat/9.1.23
Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)
Related Items
The chromatic index of nearly bipartite multigraphs, A problem of Füredi and Seymour on covering intersecting families by pairs, Edge-colouring of join graphs, Multiply balanced edge colorings of multigraphs, Edge-colouring of joins of regular graphs. I, On the bounded-hop MST problem on random Euclidean instances, Embedding partial totally symmetric quasigroups., Embedding partial triple systems, Decomposing \(K_{u + w} - K_u\) into cycles of prescribed lengths, Embedding partial Mendelsohn triple systems, Chromatic index of dense quasirandom graphs, Embedding partial extended triple systems and totally symmetric quasigroups, Excessive factorizations of bipartite multigraphs, Amalgamated Factorizations of Complete Graphs, On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs, On the equitable edge-coloring of 1-planar graphs and planar graphs, Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs, The cyclic matching sequenceability of regular graphs, Edge coloring graphs with large minimum degree, Generalized latin rectangles I: Construction and decomposition, Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor, More extreme equitable colorings of decompositions of \(K_v\) and \(K_v - F\), Edge-colouring of joins of regular graphs. II, Some results in chromatic scheduling, On minimum sets of 1-factors covering a complete multipartite graph, Graph covers using \(t\)-colourable vertex sets., Hamilton decompositions of complete graphs with a 3-factor leave., Rado's theorem for polymatroids, On the independence and chromatic numbers of random regular graphs, Edge-colouring of regular graphs of large degree, \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs, An Asymptotic Version of the Multigraph 1‐Factorization Conjecture, Polynomial time complexity of edge colouring graphs with bounded colour classes, Covering graphs with matchings of fixed size, Degree-bounded factorizations of bipartite multigraphs and of pseudographs, Compactness and balancing in scheduling, On the excessive \([m\)-index of a tree], On the Complexity of Computing the Excessive [B-Index of a Graph], A note on the ascending subgraph decomposition problem, Coloring graphs with sparse neighborhoods, Embeddings of partial Steiner triple systems, The chromatic index of graphs with large maximum degree, A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs, Fair Hamilton decompositions of complete multipartite graphs, Some graphs which have ascending subgraph decomposition, Excessive \([l, m\)-factorizations]
