A note on the bichromatic numbers of graphs
β Scribed by Dennis D. A. Epple; Jing Huang
- Publisher
- John Wiley and Sons
- Year
- 2010
- Tongue
- English
- Weight
- 90 KB
- Volume
- 65
- Category
- Article
- ISSN
- 0364-9024
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
The bichromaticity of a bipartite graph B is defined as the maximum value of r + s for which B has the complete bipartite graph K,, as a homomorphic image We determine the bichromaticity of any bipartite cylinder graph C2,, x P, or torus graph CZn x C , , In the process, w e disprove a conjecture of
It is shown that the n t h chromatic numbers of the Grotzsch graph provide the answer to an issue raised by
## Abstract Is it possible to give an abstract characterisation of constructive real numbers? A condition should be that all axioms are valid for Dedekind reals in any topos, or for constructive reals in Bishop mathematics. We present here a possible firstβorder axiomatisation of real numbers, whic