Even factors in edge-chromatic-critical graphs with a small number of divalent vertices

DOI10.1007/S00373-022-02506-XzbMath1490.05086arXiv2109.11447OpenAlexW3200815900MaRDI QIDQ2670691

Isaak H. Wolf, Eckhard Steffen

Publication date: 1 June 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.11447

zbMATH Keywords

edge-colouringcritical graphschromatic indexfactorsVizing's critical graph conjectures

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factors and factorizations of graphs. Proof techniques in factor theory
• Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem
• Reducing Vizing's 2-factor conjecture to Meredith extension of critical graphs
• Fractional matchings, component-factors and edge-chromatic critical graphs
• Independent sets and 2‐factors in edge‐chromatic‐critical graphs
• Vizing's 2‐Factor Conjecture Involving Large Maximum Degree
• A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2‐Factor Conjecture

This page was built for publication: Even factors in edge-chromatic-critical graphs with a small number of divalent vertices