Table of Contents
ISRN Combinatorics
Volume 2013 (2013), Article ID 358527, 6 pages
http://dx.doi.org/10.1155/2013/358527
Research Article

Graphs Whose Edge Set Can Be Partitioned into Maximum Matchings

Department of Mathematics, The Ohio State University, Columbus, OH 43210, USA

Received 17 October 2012; Accepted 19 November 2012

Academic Editors: A. V. Kelarev and B. Wu

Copyright © 2013 Niraj Khare. 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. I. Holyer, “The NP-completeness of edge-coloring,” SIAM Journal on Computing, vol. 10, Article ID 718720, 1981. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. D. P. Sanders and Y. Zhao, “Planar graphs of maximum degree seven are class I,” Journal of Combinatorial Theory Series B, vol. 83, no. 2, pp. 201–212, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  3. D. B. West, Introduction to Graph Theory, Prentice Hall, 1996. View at MathSciNet
  4. P. Erdos and R. J. Wilson, “On the chromatic index of almost all graphs,” Journal of Combinatorial Theory Series B, vol. 23, no. 2-3, pp. 255–257, 1977. View at Google Scholar · View at Scopus
  5. N. Balachandran and N. Khare, “Graphs with restricted valency and matching number,” Discrete Mathematics, vol. 309, no. 12, pp. 4176–4180, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. V. Chvátal and D. Hanson, “Degrees and matchings,” Journal of Combinatorial Theory Series B, vol. 20, no. 2, pp. 128–138, 1976. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  7. L. Lovasz and M. D. Plummer, Matching Theory, North Holland, Amsterdam, The Netherlands, 1986.