Algorithms for Coloring Quadtrees
<|reference_start|>Algorithms for Coloring Quadtrees: We describe simple linear time algorithms for coloring the squares of balanced and unbalanced quadtrees so that no two adjacent squares are given the same color. If squares sharing sides are defined as adjacent, we color balanced quadtrees with three colors, and unbalanced quadtrees with four colors; these results are both tight, as some quadtrees require this many colors. If squares sharing corners are defined as adjacent, we color balanced or unbalanced quadtrees with six colors; for some quadtrees, at least five colors are required.<|reference_end|>
@article{eppstein1999algorithms,
    title={Algorithms for Coloring Quadtrees},
    author={David Eppstein, Marshall W. Bern, Brad Hutchings},
    journal={Algorithmica 32(1):87-94, 2002},
    year={1999},
    doi={10.1007/s00453-001-0054-2},
    archivePrefix={arXiv},
    eprint={cs/9907030},
    primaryClass={cs.CG}
}