An extension of Vizing's adjacency lemma of edge chromatic critical graphs
type: Item
instance of: scholarly article
title: An extension of Vizing's adjacency lemma of edge chromatic critical graphs
zbMATH Open document ID: 0929.05029
DOI: 10.1016/S0012-365X(98)00397-5
author: K. Kayathri
author: S. A. Choudum
published in: Discrete Mathematics
publication date: 1999-11-29T00:00:00Z
review text: Vizing's adjacency lemma (VAL) describes an important property of edge-chromatic critical graphs, namely in an edge-chromatic critical simple graph \(G\) of the maximum degree \(\Delta \), if \(xy\) is an edge, \(x\) is adjacent with at least \(\Delta -\text{deg}(y)+1\) vertices \((\neq y)\) of degree \(\Delta \). One of the generalizations of this result to multigraphs is due to \textit{L. D. Andersen} [Math. Scand. 40, No.~2, 161-175 (1977; Zbl 0373.05035)]. In this paper an extension of Andersen's result is proposed.
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1340367
zbMATH Keywords: multigraph
zbMATH Keywords: edge-chromatic number
zbMATH Keywords: adjacency lemma
zbMATH Keywords: fan sequence
reviewed by: Ioan Tomescu
MaRDI profile type: Publication
Wikidata QID: Q124944368
full work available at URL: s0012-365x(98)00397-5
OpenAlex ID: W2026018777
description: scientific article; zbMATH DE number 1340367