The Dinitz problem solved for rectangles

DOI10.1090/S0273-0979-1993-00430-0zbMath0792.05053arXivmath/9310232MaRDI QIDQ4275683

Jeannette C. M. Janssen

Publication date: 31 January 1994

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9310232

zbMATH Keywords

orientationsrectanglespartial latin squareDinitz conjecture

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Hownotto prove the Alon-Tarsi conjecture ⋮ On the number of even and odd Latin squares of order \(p+1\) ⋮ Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph ⋮ On list coloring Steiner triple systems ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges

Cites Work

• Unnamed Item
• List-colourings of graphs
• Towards a solution of the Dinitz problem?
• A new upper bound for the list chromatic number
• Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
• Colorings and orientations of graphs
• On even and odd latin squares
• A note on list-colorings

This page was built for publication: The Dinitz problem solved for rectangles