Journal ArticleOPEN ACCESS

Pattern Periodic Coloring of Distance Graphs

Journal of Combinatorial Theory. Series B (1998) 73(2) 195-206
DOI: 10.1006/jctb.1998.1831
18Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

SupposeDis a subset ofZ. The distance graphG(Z,D) with distance setDis the graph with vertex setZand two verticesxyare adjacent if x-y∈D. We introduce a coloring method for distance graphs, the pattern periodic coloring, and we shall compare this method with other general coloring methods of distance graphs. © 1998 Academic Press.

Cite

CITATION STYLE

APA

Zhu, X. (1998). Pattern Periodic Coloring of Distance Graphs. Journal of Combinatorial Theory. Series B, 73(2), 195–206. https://doi.org/10.1006/jctb.1998.1831

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free