An extension of Vizing's adjacency lemma of edge chromatic critical graphs

DOI10.1016/S0012-365X(98)00397-5zbMath0929.05029OpenAlexW2026018777WikidataQ124944368 ScholiaQ124944368MaRDI QIDQ1304811

K. Kayathri, Sheshayya A. Choudum

Publication date: 29 November 1999

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00397-5

zbMATH Keywords

multigraphedge-chromatic numberadjacency lemmafan sequence

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \) ⋮ Some criteria for a graph to be class 1 ⋮ On zero-divisor graphs of commutative rings without identity ⋮ Vizing's coloring algorithm and the fan number ⋮ Goldberg's conjecture is true for random multigraphs

This page was built for publication: An extension of Vizing's adjacency lemma of edge chromatic critical graphs