Estimating Low Generalized Coloring Numbers of Planar Graphs
abstract: The chromatic number $\chi(G)$ of a graph $G=(V,E)$ is the minimum number of colors needed to color $V(G)$ such that no adjacent vertices receive the same color. The coloring number $\col(G)$ of a graph $G$ is the minimum number $k$ such that there exists a linear ordering of $V(G)$ fo...
| Other Authors: | |
|---|---|
| Format: | Doctoral Thesis |
| Language: | English |
| Published: |
2020
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2286/R.I.57262 |