Exact square coloring of graphs resulting from some graph operations and products
AbstractA vertex coloring of a graph [Formula: see text] is called an exact square coloring of G if any pair of vertices at distance 2 receive distinct colors. The minimum number of colors required by any exact square coloring is called the exact square chromatic number of G and is denoted by [Formu...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2022-09-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | https://www.tandfonline.com/doi/10.1080/09728600.2022.2094736 |