|
The Dinitz Problem Solved for Rectangles
Author(s):
Jeannette
C. M.
Janssen
Journal:
Bull. Amer. Math. Soc.
29
(1993),
243-249.
MSC (1991):
Primary 05C15, 05A05
MathSciNet review:
1215310
Retrieve article in:
PDF
References |
Similar articles |
Additional information
References:
- [AT]
- N. Alon and M. Tarsi, Colorings and orientations of graphs, Combinatorica \textbf{12} (1992), 125--134. MR 1179249
- [BHa]
- B. Bollob\`as and A.~J.~Harris, List colourings of graphs, Graphs and Combinatorics \textbf{1} (1985), 115--127. MR 951773
- [BHi]
- B. Bollob\`as and H.~R.~Hind, A new upper bound for the list chromatic number, Discrete Math. \textbf{74} (1989), 65--75. MR 989123
- [CH]
- Amanda Chetwynd and Roland H\"aggkvist, A note on list-colorings, J. Graph Theory \textbf{13} (1989), 87--95. MR 982870
- [ERT]
- P. Erd\"os, A. Rubin, and H. Taylor, Choosability in graphs, Congr. Numer. \textbf{26} (1979), 125--157. MR 593902
- [J]
- Jeannette C.~M.~Janssen, Even and odd latin squares, Lehigh Univ. doctoral dissertation, 1993. MR
- [H]
- Roland H\"aggkvist, Towards a solution of the Dinitz problem\RM ?, Discrete Math. \textbf{75} (1989), 247--251. MR 1001399
- [K1]
- Jeff Kahn, Recent results on some not-so-recent hypergraph matching and covering problems, Proceedings of the Conference on Extremal Problems for Finite Sets, Visegr\`ad, Hungary, 1991. MR
- [K2]
- Jeff Kahn, Coloring nearly-disjoint hypergraphs with $n + \text {o}(n)$ colors, J.~Combin.~Theory Ser. A \textbf{59} (1992), 31--39. MR 1141320
Similar Articles:
Retrieve articles in Bulletin of the American Mathematical Society
with MSC
(1991):
05C15, 05A05
Retrieve articles in all Journals with MSC
(1991):
05C15, 05A05
Additional Information:
DOI:
10.1090/S0273-0979-1993-00430-0
PII:
S 0273-0979(1993)00430-0
|
