Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices
Open Access
- 30 May 2022
- journal article
- research article
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 38 (3) , 1-11
Abstract
A finite simple connected graph G with maximum degree k is k-critical if it has chromatic index $$\chi '(G)=k+1$$ and $$\chi '(G-e)=k$$ for every edge $$e\in E(G)$$ . Bej and the first author [2] raised the question whether every k-critical graph has an even factor. We prove that every k-critical graphs with at most $$2k-6$$ vertices of degree 2 has an even factor.
Keywords
All Related Versions
Funding Information
- Deutsche Forschungsgemeinschaft (STE 792/3-1)
- Universität Paderborn
This publication has 7 references indexed in Scilit:
- Fractional Matchings, Component-Factors and Edge-Chromatic Critical GraphsGraphs and Combinatorics, 2021
- Reducing Vizing's 2-Factor Conjecture to Meredith Extension of Critical GraphsGraphs and Combinatorics, 2020
- Vizing's 2‐Factor Conjecture Involving Large Maximum DegreeJournal of Graph Theory, 2017
- A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian-An Approach to Vizing's 2-Factor ConjectureJournal of Graph Theory, 2012
- Factors and Factorizations of Graphs2011
- Independent sets and 2‐factors in edge‐chromatic‐critical graphsJournal of Graph Theory, 2003
- Spanning eularian subgraphs, the splitting Lemma, and Petersen's theoremDiscrete Mathematics, 1992