## Abstract In 1976, Borodin conjectured that every planar graph has a 5‐coloring such that the union of every __k__ color classes with 1 ≤ __k__ ≤ 4 induces a (__k__—1)‐degenerate graph. We prove the existence of such a coloring using 18 colors. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:139
Independent collections of translates of boxes and a conjecture due to Grünbaum
✍ Scribed by Daniel Q. Naiman; Henry P. Wynn
- Publisher
- Springer
- Year
- 1993
- Tongue
- English
- Weight
- 302 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0179-5376
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We establish a duality principle for arrangements of pseudolines in the projective plane, and thereby prove the conjecture of Burr, Griinbaum, and Sloane that the solution T(p) of the "orchard problem" for pseudoline arrangements and the solution r(p) of the dual problem xe equa1.
We have conducted a simulation study in small pedigrees to investigate the power to detect linkage and heterogeneity for a disorder due to either one of two independent disease loci. We have considered a highly polymorphic marker locus (PIC = 70%) linked to one disease locus and unlinked to the seco