List edge chromatic number of graphs with large girth (Q1197027): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q312270 |
||
Property / author | |||
Property / author: Q178710 / rank | |||
Revision as of 02:05, 13 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | List edge chromatic number of graphs with large girth |
scientific article |
Statements
List edge chromatic number of graphs with large girth (English)
0 references
16 January 1993
0 references
The list edge chromatic number \(le\chi(G)\) of a graph \(G\) is the smallest integer \(k\) such that whenever each edge \(e\in E(G)\) is assigned a list \(\varphi(e)\) of \(k\) admissible colors, then there exists a proper coloring \(f\) of \(E(G)\) so that each \(e\in E(G)\) is colored by a color \(f(e)\in\varphi(e)\). It is shown that if \(G\) has maximum degree \(\Delta\) and girth at least \(8\Delta(ln\Delta+1.1)\), then \(le\chi(G)=\Delta\) or \(\Delta+1\).
0 references
edge chromatic number
0 references
proper coloring
0 references
maximum degree
0 references
girth
0 references