Fractional matchings and component-factors of (edge-chromatic critical) graphs.
Antje Klopp, Eckhard Steffen · arXiv (Cornell University) · 2019
The paper studies component-factors of graphs which can be characterized in terms of their fractional matching number. These results are used to prove that every edge-chromatic critical graph has a $[1,2]$-factor. Furthermore, fractional matchings of edge-chromatic critical graphs are studied and some questions are related to Vizing's conjectures on the independence number and 2-factors of edge-chromatic critical graphs.