vertices, for p odd. has shown however t e of graphs on PO vertices whose construction was described in [ 11. search was na o other graph with this chromatic polynomial was found. es
A Note on the Uniqueness of (w, r) Cover-Free Codes
β Scribed by V. S. Lebedev
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 2005
- Tongue
- English
- Weight
- 89 KB
- Volume
- 41
- Category
- Article
- ISSN
- 0032-9460
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In Bandelt and Dress AdΒ¨. in Math. 92 1992 , 47α105 the concept of a coherent decomposition of a finite metric is introduced and it is conjectured that every such metric can be decomposed into a coherent sum of prime metrics in a unique way. In this note we give a counterexample to this conjecture.
## Abstract We give a 4βchromatic planar graph, which admits a vertex partition into three parts such that the union of every two of them induces a forest. This solves a problem posed by BΓΆhme. Also, by constructing an infinite sequence of graphs, we show that the cover degeneracy can be arbitraril