On Coloring Catalan Number Distance Graphs and Interference Graphs
A vertex coloring of a graph G is a mapping that allots colors to the vertices of G. Such a coloring is said to be a proper vertex coloring if two vertices joined by an edge receive different colors. The chromatic number χ ( G ) is the least number of colors used in a proper vertex c...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2018-10-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | http://www.mdpi.com/2073-8994/10/10/468 |