The Solution of a Timetabling Problem

Cited in

(48)

Decomposing $K_{u + w} - K_u$ into cycles of prescribed lengths
Some graphs which have ascending subgraph decomposition
Fair Hamilton decompositions of complete multipartite graphs
The chromatic index of nearly bipartite multigraphs
Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor
Compactness and balancing in scheduling
An asymptotic version of the multigraph 1-factorization conjecture
Embedding partial Mendelsohn triple systems
Embedding partial triple systems
Edge-colouring of joins of regular graphs. I
Ascending subgraph decomposition
Embedding partial totally symmetric quasigroups.
(r,r+1)-factorizations of (d,d+1)-graphs
Graph covers using $t$-colourable vertex sets.
Multiply balanced edge colorings of multigraphs
Polynomial time complexity of edge colouring graphs with bounded colour classes
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
A note on the ascending subgraph decomposition problem
Excessive $[l, m]$-factorizations
Rado's theorem for polymatroids
Hamilton decompositions of complete graphs with a 3-factor leave.
Amalgamated Factorizations of Complete Graphs
Embedding partial extended triple systems and totally symmetric quasigroups
Excessive factorizations of bipartite multigraphs
A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs
Embeddings of partial Steiner triple systems
Degree-bounded factorizations of bipartite multigraphs and of pseudographs
On the excessive $[m]$-index of a tree
On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs
On the independence and chromatic numbers of random regular graphs
Covering graphs with matchings of fixed size
On the complexity of computing the excessive $[B]$-index of a graph
Edge-colouring of regular graphs of large degree
The cyclic matching sequenceability of regular graphs
A problem of Füredi and Seymour on covering intersecting families by pairs
Chromatic index of dense quasirandom graphs
On minimum sets of 1-factors covering a complete multipartite graph
The chromatic index of graphs with large maximum degree
Total coloring graphs with large maximum degree
Coloring graphs with sparse neighborhoods
Edge coloring graphs with large minimum degree
Edge-colouring of joins of regular graphs. II
On the bounded-hop MST problem on random Euclidean instances
More extreme equitable colorings of decompositions of $K_v$ and $K_v - F$
Generalized latin rectangles I: Construction and decomposition
Some results in chromatic scheduling
Edge-colouring of join graphs

This page was built for publication: The Solution of a Timetabling Problem

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