List edge chromatic number of graphs with large girth (Q1197027): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Q178710 / rank | |||
Property / author | |||
Property / author: Alexandr V. Kostochka / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new upper bound for the list chromatic number / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3922703 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An upper bound for the total chromatic number / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3858290 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4163548 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4135588 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(92)90602-c / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2103721329 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:59, 30 July 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
0 references