Polychromatic Colorings of Subcubes of the Hypercube
β Scribed by Offner, David
- Book ID
- 118196977
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 2008
- Tongue
- English
- Weight
- 155 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0895-4801
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract A __polychromatic k__β__coloring__ of a plane graph __G__ is an assignment of __k__ colors to the vertices of __G__ such that every face of __G__ has __all k__ colors on its boundary. For a given plane graph __G__, one seeks the __maximum__ number __k__ such that __G__ admits a polychro
## Abstract The __square__ __G__^2^ of a graph __G__ is the graph with the same vertex set __G__ and with two vertices adjacent if their distance in __G__ is at most 2. Thomassen showed that every planar graph __G__ with maximum degree Ξ(__G__)β=β3 satisfies Ο(__G__^2^)ββ€β7. Kostochka and Woodall c