A new tool for proving Vizing's theorem

DOI10.1016/J.DISC.2014.02.021MaRDI QIDQ2449145zbMATH OpenOpenAlexFDO

Authors Alexandr Kostochka

Publication date 6 May 2014

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2014.02.021

zbMATH Keywords

adjacency lemmacritical graphsedge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Recommendations

• On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs
• Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture
• A constructive proof of Vizing's theorem
• Some consequences of a theorem on fans
• A new method of proving theorems on chromatic index

Cites work

• A new method of proving theorems on chromatic index
• Edge-coloring of multigraphs: Recoloring technique
• Graph edge coloring. Vizing's theorem and Goldberg's conjecture
• scientific article; zbMATH DE number 3643303 (Why is no real title available?)
• scientific article; zbMATH DE number 3266380 (Why is no real title available?)
• scientific article; zbMATH DE number 3273761 (Why is no real title available?)
• On edge-colorings of graphs.

Cited in

(7)

• A constructive proof of Vizing's theorem
• On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs
• Graph edge coloring: a survey
• How To Make Davies' Theorem Visible
• Short proofs of classical theorems
• Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture
• On fans in multigraphs

This page was built for publication: A new tool for proving Vizing's theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2449145)