Additive List Coloring of Planar Graphs with Given Girth
An additive coloring of a graph G is a labeling of the vertices of G from {1, 2, . . . , k} such that two adjacent vertices have distinct sums of labels on their neighbors. The least integer k for which a graph G has an additive coloring is called the additive coloring number of G, denoted χΣ (G). A...
| 出版年: | Discussiones Mathematicae Graph Theory |
|---|---|
| 主要な著者: | , , |
| フォーマット: | 論文 |
| 言語: | 英語 |
| 出版事項: |
University of Zielona Góra
2020-08-01
|
| 主題: | |
| オンライン･アクセス: | https://doi.org/10.7151/dmgt.2156 |