The following pages link to (Q5604409):
Displayed 35 items.
- On the chromatic index of cographs and join graphs (Q324879) (← links)
- On the existence spectrum for sharply transitive \(G\)-designs, \(G\) a \([k]\)-matching (Q400365) (← links)
- Edge coloring complete uniform hypergraphs with many components (Q598467) (← links)
- A generalization of interval edge-colorings of graphs (Q602763) (← links)
- The chromatic index of graphs with large maximum degree (Q786820) (← links)
- Covering graphs with matchings of fixed size (Q960925) (← links)
- Some sequences associated with combinatorial structures (Q1073032) (← links)
- The chromatic index of nearly bipartite multigraphs (Q1076034) (← links)
- Some applications of doubly stochastic matrices (Q1110617) (← links)
- Generalized latin rectangles I: Construction and decomposition (Q1144022) (← links)
- Critical graphs for chromatic difference sequences (Q1144038) (← links)
- Class-uniformly resolvable pairwise balanced designs with block size two and three (Q1182939) (← links)
- The spectrum of maximal sets of one-factors (Q1184003) (← links)
- Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource (Q1186309) (← links)
- Packing, covering and decomposing of a complete uniform hypergraph into delta-systems (Q1205344) (← links)
- Some remarks on good colorations (Q1216325) (← links)
- Multigraphs with quasiweak odd cycles (Q1245852) (← links)
- Extensions of coloring models for scheduling purposes (Q1268282) (← links)
- Majorization, packing, covering and matroids (Q1309465) (← links)
- Wide partitions, Latin tableaux, and Rota's basis conjecture (Q1415381) (← links)
- Short solution of Kotzig's problem for bipartite graphs (Q1569037) (← links)
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree (Q1752497) (← links)
- Generalized edge packings (Q1825138) (← links)
- Edge-colouring graphs with bounded local degree sums (Q2184694) (← links)
- Investigations on an edge coloring problem (Q2546513) (← links)
- A preemptive open shop scheduling problem with one resource (Q2641218) (← links)
- Solving Matching Problems Efficiently in Bipartite Graphs (Q2946048) (← links)
- Transversal matroid intersections and related packings (Q4126086) (← links)
- (Q4404922) (← links)
- Partitions into odd chains (Q4726019) (← links)
- ACTIVE REDUNDANCY ALLOCATION FOR COHERENT SYSTEMS WITH INDEPENDENT AND HETEROGENEOUS COMPONENTS (Q5050869) (← links)
- Polyhedra and optimization in connection with a weak majorization ordering (Q5101434) (← links)
- Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings (Q5219667) (← links)
- Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs (Q6045402) (← links)
- A tutorial on graph models for scheduling round‐robin sports tournaments (Q6056890) (← links)