Some colouring problems for unit-quadrance graphs
Combinatorics
2007-05-23 v1
Abstract
The quadrance between two points and is the number . Let be an odd prime power and be the finite field with elements. The unit-quadrance graph has the vertex set , and are adjacent if and only if . In this paper, we study some colouring problems for the unit-quadrance graph and discuss some open problems.
Cite
@article{arxiv.math/0606482,
title = {Some colouring problems for unit-quadrance graphs},
author = {Le Anh Vinh},
journal= {arXiv preprint arXiv:math/0606482},
year = {2007}
}