Maximal k-edge-colorable subgraphs, Vizing's Theorem, and Tuza's Conjecture

Gregory J. Puleo. Maximal k-edge-colorable subgraphs, Vizing's Theorem, and Tuza's Conjecture. Discrete Mathematics, 340(7):1573-1580, 2017. [doi]

@article{Puleo17,
  title = {Maximal k-edge-colorable subgraphs, Vizing's Theorem, and Tuza's Conjecture},
  author = {Gregory J. Puleo},
  year = {2017},
  doi = {10.1016/j.disc.2017.02.020},
  url = {http://dx.doi.org/10.1016/j.disc.2017.02.020},
  researchr = {https://researchr.org/publication/Puleo17},
  cites = {0},
  citedby = {0},
  journal = {Discrete Mathematics},
  volume = {340},
  number = {7},
  pages = {1573-1580},
}