Plane graphs are entirely \((\Delta + 5)\)-choosable (Q2875688)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6328440
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Plane graphs are entirely \((\Delta + 5)\)-choosable |
scientific article; zbMATH DE number 6328440 |
Statements
11 August 2014
0 references
plane graph
0 references
entire choosability
0 references
maximum degree
0 references
discharging method
0 references
Plane graphs are entirely \((\Delta + 5)\)-choosable (English)
0 references
Assume that we assign a list of colors \(L(x)\), \(|L(x)|\leq k\), to each element \(x\) of the set \(V(G)\cup E(G)\cup F(G)\), where \(G\) is a plane graph. If it is possible to color the elements of \(V(G)\cup E(G)\cup F(G)\) in such a way that all the adjacent and incident elements have distinct colors, then we say that \(G\) is entirely \(k\)-choosable. The authors use the discharching method to show that every plane graph with \(\Delta(G)\leq 5\) is entirely \((\Delta(G)+5)\)-choosable.
0 references
0.9186477661132812
0 references
0.9182616472244264
0 references
0.9053328633308412
0 references
0.8712151646614075
0 references
0.8574116826057434
0 references
