Hall's theorem and extending partial Latinized rectangles
From MaRDI portal
Publication:476287
DOI10.1016/J.JCTA.2014.10.007zbMath1303.05021OpenAlexW2066019260MaRDI QIDQ476287
Sibel Özkan, D. G. Hoffman, Anthony J. W. Hilton, John L. Goldwasser
Publication date: 28 November 2014
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2014.10.007
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extending Hall's theorem into list colorings: a partial history
- Hall's Condition for Partial Latin Squares
- An analogue of Ryser's Theorem for partial Sudoku squares
- Cropper's question and Cruse's theorem about partial Latin squares
- Maximal Flow Through a Network
- Characterization of graphs with hall number 2
- On Representatives of Subsets
- Hall parameters of complete and complete bipartite graphs
- A Combinatorial Theorem with an Application to Latin Rectangles
- An existence theorem for latin squares
- Relations among the fractional chromatic, choice, Hall, and Hall-condition numbers of simple graphs
This page was built for publication: Hall's theorem and extending partial Latinized rectangles