- Tytuł:
- List Edge Coloring of Planar Graphs without 6-Cycles with Two Chords
- Autorzy:
-
Hu, Linna
Sun, Lei
Wu, Jian-Liang - Powiązania:
- https://bibliotekanauki.pl/articles/32083824.pdf
- Data publikacji:
- 2021-02-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
planar graph
edge choosable
list edge chromatic number
chord - Opis:
- A graph G is edge-L-colorable if for a given edge assignment L = {L(e) : e ∈ E(G)}, there exists a proper edge-coloring φ of G such that φ(e) ∈ L(e) for all e ∈ E(G). If G is edge-L-colorable for every edge assignment L such that |L(e)| ≥ k for all e ∈ E(G), then G is said to be edge-k-choosable. In this paper, we prove that if G is a planar graph without 6-cycles with two chords, then G is edge-k-choosable, where k = max{7, Δ(G) + 1}, and is edge-t-choosable, where t = max{9, Δ(G)}.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2021, 41, 1; 199-211
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł