An extension of Vizing's adjacency lemma of edge chromatic critical graphs
From MaRDI portal
Publication:1304811
DOI10.1016/S0012-365X(98)00397-5zbMath0929.05029WikidataQ124944368 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
05C15: Coloring of graphs and hypergraphs
Related Items
On zero-divisor graphs of commutative rings without identity, Some criteria for a graph to be class 1, The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \), Goldberg's conjecture is true for random multigraphs, Vizing's coloring algorithm and the fan number