Vizing's 2‐Factor Conjecture Involving Large Maximum Degree

DOI10.1002/jgt.22135zbMath1375.05060arXiv1404.6299OpenAlexW2964097023WikidataQ123336344 ScholiaQ123336344MaRDI QIDQ4596325

Songling Shan, Guantao Chen

Publication date: 1 December 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

critical graphsedge chromatic indexTutte's 2-factor theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (5)

Even factors in edge-chromatic-critical graphs with a small number of divalent vertices ⋮ Hamiltonicity of edge-chromatic critical graphs ⋮ Vizing's 2-factor conjecture involving toughness and maximum degree conditions ⋮ Reducing Vizing's 2-factor conjecture to Meredith extension of critical graphs ⋮ Graph edge coloring: a survey

This page was built for publication: Vizing's 2‐Factor Conjecture Involving Large Maximum Degree