Fractional matchings and component-factors of (edge-chromatic critical) graphs

A. Klopp, E. Steffen, ArXiv:1903.12385 (2019).

Download
No fulltext has been uploaded.
Preprint | English
Author
Abstract
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.
Publishing Year
Journal Title
arXiv:1903.12385
LibreCat-ID

Cite this

Klopp A, Steffen E. Fractional matchings and component-factors of (edge-chromatic critical)  graphs. arXiv:190312385. 2019.
Klopp, A., & Steffen, E. (2019). Fractional matchings and component-factors of (edge-chromatic critical)  graphs. ArXiv:1903.12385.
@article{Klopp_Steffen_2019, title={Fractional matchings and component-factors of (edge-chromatic critical)  graphs}, journal={arXiv:1903.12385}, author={Klopp, Antje and Steffen, Eckhard}, year={2019} }
Klopp, Antje, and Eckhard Steffen. “Fractional Matchings and Component-Factors of (Edge-Chromatic Critical)  Graphs.” ArXiv:1903.12385, 2019.
A. Klopp and E. Steffen, “Fractional matchings and component-factors of (edge-chromatic critical)  graphs,” arXiv:1903.12385. 2019.
Klopp, Antje, and Eckhard Steffen. “Fractional Matchings and Component-Factors of (Edge-Chromatic Critical)  Graphs.” ArXiv:1903.12385, 2019.

Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar