Strawinsky Number || Note on the New "Petrouchka"
β Scribed by Henry Boys
- Book ID
- 124535761
- Publisher
- Cambridge University Press
- Year
- 1948
- Tongue
- English
- Weight
- 349 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0040-2982
- DOI
- 10.2307/942695
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract The distance coloring number __X__~__d__~(__G__) of a graph __G__ is the minimum number __n__ such that every vertex of __G__ can be assigned a natural number __m__ β€ __n__ and no two vertices at distance __i__ are both assigned __i__. It is proved that for any natural number __n__ ther
## Abstract A. Vince introduced a natural generalization of graph coloring and proved some basic facts, revealing it to be a concept of interest. His work relies on continuous methods. In this note we make some simple observations that lead to a purely combinatorial treatment. Our methods yield sho