An extension of Vizing's adjacency lemma of edge chromatic critical graphs (Q1304811): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q124944368, #quickstatements; #temporary_batch_1711439739529 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(98)00397-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2026018777 / rank | |||
Normal rank | |||
Latest revision as of 10:38, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An extension of Vizing's adjacency lemma of edge chromatic critical graphs |
scientific article |
Statements
An extension of Vizing's adjacency lemma of edge chromatic critical graphs (English)
0 references
29 November 1999
0 references
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.
0 references
multigraph
0 references
edge-chromatic number
0 references
adjacency lemma
0 references
fan sequence
0 references
