Pages that link to "Item:Q5655204"
From MaRDI portal
The following pages link to The Solution of a Timetabling Problem (Q5655204):
Displaying 46 items.
- Excessive factorizations of bipartite multigraphs (Q602754) (← links)
- On the excessive \([m]\)-index of a tree (Q741745) (← links)
- A note on the ascending subgraph decomposition problem (Q750466) (← links)
- The chromatic index of graphs with large maximum degree (Q786820) (← links)
- Edge-colouring of joins of regular graphs. I (Q849137) (← links)
- Covering graphs with matchings of fixed size (Q960925) (← links)
- Degree-bounded factorizations of bipartite multigraphs and of pseudographs (Q960926) (← links)
- The chromatic index of nearly bipartite multigraphs (Q1076034) (← links)
- Embedding partial triple systems (Q1112041) (← links)
- Embedding partial Mendelsohn triple systems (Q1114692) (← links)
- On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs (Q1126293) (← links)
- Generalized latin rectangles I: Construction and decomposition (Q1144022) (← links)
- On the independence and chromatic numbers of random regular graphs (Q1186131) (← links)
- A problem of Füredi and Seymour on covering intersecting families by pairs (Q1337172) (← links)
- Embedding partial extended triple systems and totally symmetric quasigroups (Q1377692) (← links)
- Graph covers using \(t\)-colourable vertex sets. (Q1427470) (← links)
- Hamilton decompositions of complete graphs with a 3-factor leave. (Q1428535) (← links)
- Coloring graphs with sparse neighborhoods (Q1569053) (← links)
- More extreme equitable colorings of decompositions of \(K_v\) and \(K_v - F\) (Q1699575) (← links)
- Embeddings of partial Steiner triple systems (Q1826857) (← links)
- Fair Hamilton decompositions of complete multipartite graphs (Q1850614) (← links)
- Some graphs which have ascending subgraph decomposition (Q1864222) (← links)
- Edge-colouring of joins of regular graphs. II (Q1945699) (← links)
- Chromatic index of dense quasirandom graphs (Q2171027) (← links)
- Polynomial time complexity of edge colouring graphs with bounded colour classes (Q2249736) (← links)
- Excessive \([l, m]\)-factorizations (Q2352055) (← links)
- Edge-colouring of join graphs (Q2369004) (← links)
- On the bounded-hop MST problem on random Euclidean instances (Q2382669) (← links)
- Decomposing \(K_{u + w} - K_u\) into cycles of prescribed lengths (Q2397526) (← links)
- On the equitable edge-coloring of 1-planar graphs and planar graphs (Q2409529) (← links)
- Edge-colouring of regular graphs of large degree (Q2465629) (← links)
- \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs (Q2470430) (← links)
- Embedding partial totally symmetric quasigroups. (Q2642022) (← links)
- On the Complexity of Computing the Excessive [<i>B</i>]-Index of a Graph (Q2811195) (← links)
- Multiply balanced edge colorings of multigraphs (Q2897208) (← links)
- On minimum sets of 1-factors covering a complete multipartite graph (Q3522849) (← links)
- Some results in chromatic scheduling (Q4052161) (← links)
- Rado's theorem for polymatroids (Q4083682) (← links)
- Compactness and balancing in scheduling (Q4145144) (← links)
- Amalgamated Factorizations of Complete Graphs (Q4305317) (← links)
- An Asymptotic Version of the Multigraph 1‐Factorization Conjecture (Q4908822) (← links)
- A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs (Q5505673) (← links)
- Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs (Q6045402) (← links)
- The cyclic matching sequenceability of regular graphs (Q6056787) (← links)
- Edge coloring graphs with large minimum degree (Q6094039) (← links)
- Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor (Q6135844) (← links)
