On chromatic numbers of some distance graphs

preprint2016arXivOpen access

In this paper we find chromatic numbers of distance graphs $G(n,3,2)$ for infinitely many n. Also we improve upper bound for $χ(G(n,r,s))$ in large part of cases.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

On chromatic numbers of some distance graphs

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0