- Tytuł:
- Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
- Autorzy:
-
Bu, Yuehua
Lih, Ko-Wei
Wang, Weifan - Powiązania:
- https://bibliotekanauki.pl/articles/743930.pdf
- Data publikacji:
- 2011
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
edge-coloring
vertex-distinguishing
planar graph - Opis:
- An adjacent vertex distinguishing edge-coloring of a graph G is a proper edge-coloring o G such that any pair of adjacent vertices are incident to distinct sets of colors. The minimum number of colors required for an adjacent vertex distinguishing edge-coloring of G is denoted by χ'ₐ(G). We prove that χ'ₐ(G) is at most the maximum degree plus 2 if G is a planar graph without isolated edges whose girth is at least 6. This gives new evidence to a conjecture proposed in [Z. Zhang, L. Liu, and J. Wang, Adjacent strong edge coloring of graphs, Appl. Math. Lett., 15 (2002) 623-626.]
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2011, 31, 3; 429-439
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł