On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths
An L(2, 1)-coloring of a graph G is a mapping such that for all edges uv of G, and if u and v are at distance two in G. The span of an L(2, 1)-coloring f of G, denoted by span(f), is max The span of G, denoted by is the minimum span of all possible L(2, 1)-colorings of G. If f is an L(2, 1)-coloring...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2020-09-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2019.12.023 |