Choice-Perfect Graphs
Given a graph G = (V,E) and a set Lv of admissible colors for each vertex v ∈ V (termed the list at v), a list coloring of G is a (proper) vertex coloring ϕ : V → S v2V Lv such that ϕ(v) ∈ Lv for all v ∈ V and ϕ(u) 6= ϕ(v) for all uv ∈ E. If such a ϕ exists, G is said to be list colorable. The choic...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2013-03-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.1660 |
| id |
doaj-0eadc8513478453498ee0cdb74c0ede9 |
|---|---|
| record_format |
Article |
| spelling |
doaj-0eadc8513478453498ee0cdb74c0ede92021-09-05T17:20:19ZengSciendoDiscussiones Mathematicae Graph Theory2083-58922013-03-0133123124210.7151/dmgt.1660Choice-Perfect GraphsTuza Zsolt0Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences H–1053 Budapest, Reáltanoda u. 13–15, HungaryGiven a graph G = (V,E) and a set Lv of admissible colors for each vertex v ∈ V (termed the list at v), a list coloring of G is a (proper) vertex coloring ϕ : V → S v2V Lv such that ϕ(v) ∈ Lv for all v ∈ V and ϕ(u) 6= ϕ(v) for all uv ∈ E. If such a ϕ exists, G is said to be list colorable. The choice number of G is the smallest natural number k for which G is list colorable whenever each list contains at least k colors.https://doi.org/10.7151/dmgt.1660graph coloringlist coloringchoice-perfect graph |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Tuza Zsolt |
| spellingShingle |
Tuza Zsolt Choice-Perfect Graphs Discussiones Mathematicae Graph Theory graph coloring list coloring choice-perfect graph |
| author_facet |
Tuza Zsolt |
| author_sort |
Tuza Zsolt |
| title |
Choice-Perfect Graphs |
| title_short |
Choice-Perfect Graphs |
| title_full |
Choice-Perfect Graphs |
| title_fullStr |
Choice-Perfect Graphs |
| title_full_unstemmed |
Choice-Perfect Graphs |
| title_sort |
choice-perfect graphs |
| publisher |
Sciendo |
| series |
Discussiones Mathematicae Graph Theory |
| issn |
2083-5892 |
| publishDate |
2013-03-01 |
| description |
Given a graph G = (V,E) and a set Lv of admissible colors for each vertex v ∈ V (termed the list at v), a list coloring of G is a (proper) vertex coloring ϕ : V → S v2V Lv such that ϕ(v) ∈ Lv for all v ∈ V and ϕ(u) 6= ϕ(v) for all uv ∈ E. If such a ϕ exists, G is said to be list colorable. The choice number of G is the smallest natural number k for which G is list colorable whenever each list contains at least k colors. |
| topic |
graph coloring list coloring choice-perfect graph |
| url |
https://doi.org/10.7151/dmgt.1660 |
| work_keys_str_mv |
AT tuzazsolt choiceperfectgraphs |
| _version_ |
1717786559002968064 |