- Tytuł:
- Total Colorings of Embedded Graphs with No 3-Cycles Adjacent to 4-Cycles
- Autorzy:
-
Wang, Bing
Wu, Jian-Liang
Sun, Lin - Powiązania:
- https://bibliotekanauki.pl/articles/31342246.pdf
- Data publikacji:
- 2018-11-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
total coloring
embedded graph
cycle - Opis:
- A total-k-coloring of a graph G is a coloring of V ∪ E using k colors such that no two adjacent or incident elements receive the same color. The total chromatic number χ′′(G) of G is the smallest integer k such that G has a total-k-coloring. Let G be a graph embedded in a surface of Euler characteristic ε ≥ 0. If G contains no 3-cycles adjacent to 4-cycles, that is, no 3-cycle has a common edge with a 4-cycle, then χ′′(G) ≤ max{8, Δ+1}.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2018, 38, 4; 977-989
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł