Table of Contents Author Guidelines Submit a Manuscript
International Journal of Mathematics and Mathematical Sciences
Volume 2007 (2007), Article ID 72168, 17 pages
http://dx.doi.org/10.1155/2007/72168
Review Article

Extending Hall's Theorem into List Colorings: A Partial History

Department of Mathematics and Statistics, Auburn University, Auburn 36849, AL, USA

Received 14 September 2006; Accepted 12 February 2007

Academic Editor: Eugene H. Dshalalow

Copyright © 2007 D. G. Hoffman and P. D. Johnson Jr. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. V. G. Vizing, “Coloring the vertices of a graph in prescribed colors,” Metody Diskretnogo Analiza, no. 29, pp. 3–10, 101, 1976 (Russian). View at MathSciNet
  2. P. Erdös, A. L. Rubin, and H. Taylor, “Choosability in graphs,” in Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing (Humboldt State Univ., Arcata, Calif., 1979), vol. 26 of Congressus Numerantium, pp. 125–157, Utilitas Math., Winnipeg, Man, Canada, 1980. View at Zentralblatt MATH · View at MathSciNet
  3. F. Galvin, “The list chromatic index of a bipartite multigraph,” Journal of Combinatorial Theory. Series B, vol. 63, no. 1, pp. 153–158, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. P. Hall, “On representatives of subsets,” Journal of the London Mathematical Society, vol. 10, no. 37, pp. 26–30, 1935. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  5. A. J. W. Hilton and P. D. Johnson Jr., “A variation of Ryser's theorem and a necessary condition for the list-colouring problem,” in Graph Colourings (Milton Keynes, 1988), R. Nelson and R. Wilson, Eds., vol. 218 of Pitman Research Notes in Mathematics, chapter 10, pp. 135–143, John Wiley & Sons, New York, NY, USA, 1990. View at Zentralblatt MATH · View at MathSciNet
  6. A. J. W. Hilton and P. D. Johnson Jr., “Extending Hall's theorem,” in Topics in Combinatorics and Graph Theory: Essays in Honour of Gerhard Ringel, pp. 359–371, Physica, Heidelberg, Germany, 1990. View at Zentralblatt MATH · View at MathSciNet
  7. A. J. W. Hilton, P. D. Johnson Jr., and E. B. Wantland, “The Hall number of a simple graph,” Congressus Numerantium, vol. 121, pp. 161–182, 1996. View at Zentralblatt MATH · View at MathSciNet
  8. C. Eslahchi and M. Johnson, “Characterization of graphs with Hall number 2,” Journal of Graph Theory, vol. 45, no. 2, pp. 81–100, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. P. D. Johnson Jr., “Hall's condition for list-coloring, and the Hall parameters: recent developments,” Discrete Mathematics, vol. 249, no. 1–3, pp. 135–147, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. R. Rado, “A theorem on general measure functions,” Proceedings of the London Mathematical Society, vol. 44, no. 1, pp. 61–91, 1938. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  11. P. R. Halmos and H. E. Vaughan, “The marriage problem,” American Journal of Mathematics, vol. 72, no. 1, pp. 214–215, 1950. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. B. Bollobás and N. Th. Varopoulos, “Representation of systems of measurable sets,” Mathematical Proceedings of the Cambridge Philosophical Society, vol. 78, no. 2, pp. 323–325, 1975. View at Zentralblatt MATH · View at MathSciNet
  13. S. Stahl, “n-tuple colorings and associated graphs,” Journal of Combinatorial Theory. Series B, vol. 20, no. 2, pp. 185–203, 1976. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. M. M. Cropper, “Hall's condition yields less for multicolorings,” The Australasian Journal of Combinatorics, vol. 18, pp. 263–266, 1998. View at Zentralblatt MATH · View at MathSciNet
  15. M. Cropper, A. Gyárfás, and J. Lehel, “Edge list multicoloring trees: an extension of Hall's theorem,” Journal of Graph Theory, vol. 42, no. 3, pp. 246–255, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. P. D. Johnson Jr. and E. B. Wantland, “Two problems concerning Hall's condition,” Congressus Numerantium, vol. 152, pp. 189–196, 2001. View at Zentralblatt MATH · View at MathSciNet
  17. A. J. W. Hilton and P. D. Johnson Jr., “List multicolorings of graphs with measurable sets,” Journal of Graph Theory, vol. 54, no. 3, pp. 179–193, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  18. J. Edmonds and D. R. Fulkerson, “Transversals and matroid partition,” Journal of Research of the National Bureau of Standards, vol. 69B, pp. 147–153, 1965. View at Zentralblatt MATH · View at MathSciNet