✦ LIBER ✦

Pattern Periodic Coloring of Distance Graphs

✍ Scribed by Xuding Zhu

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 250 KB
Volume: 73
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1998.1831

No coin nor oath required. For personal study only.

✦ Synopsis

Suppose D is a subset of Z. The distance graph G(Z, D) with distance set D is the graph with vertex set Z and two vertices x, y are 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.

📜 SIMILAR VOLUMES

Distance Graphs andT-Coloring

✍ Gerard J Chang; Daphne D.-F Liu; Xuding Zhu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 126 KB

We discuss relationships among T-colorings of graphs and chromatic numbers, fractional chromatic numbers, and circular chromatic numbers of distance graphs. We first prove that for any finite integral set T that contains 0, the asymptotic T-coloring ratio R(T ) is equal to the fractional chromatic n

Average distance in colored graphs

✍ Peter Dankelmann; Wayne Goddard; Peter Slater 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB

## Abstract For a graph __G__ where the vertices are colored, the __colored distance__ of __G__ is defined as the sum of the distances between all unordered pairs of vertices having different colors. Then for a fixed supply __s__ of colors, __d~s~(G)__ is defined as the minimum colored distance ove

Star coloring of graphs

✍ Guillaume Fertin; André Raspaud; Bruce Reed 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB

## Abstract A __star coloring__ of an undirected graph __G__ is a proper vertex coloring of __G__ (i.e., no two neighbors are assigned the same color) such that any path of length 3 in __G__ is not bicolored. The __star chromatic number__ of an undirected graph __G__, denoted by χ~s~(__G__), is the

All Unit-Distance Graphs of Order 6197 A

All Unit-Distance Graphs of Order 6197 Are 6-Colorable

✍ Dan Pritikin 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 312 KB

Consider any 6197 or fewer points in the plane, and create a graph with this vertex set by considering a pair of those points to be adjacent if and only if their distance is exactly 1. It is shown that the vertices of the resulting graph can be properly 6-colored. 1998 Academic Press Consider R 2 =

Coloring edges of embedded graphs

✍ Daniel P. Sanders; Yue Zhao 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB 👁 2 views

In this paper, we prove that any graph G with maximum degree ÁG ! 11 p 49À241AEa2, which is embeddable in a surface AE of characteristic 1AE 1 and satis®es jVGj b 2ÁGÀ5À2 p 6ÁG, is class one.

Balanced coloring of bipartite graphs

✍ Uriel Feige; Shimon Kogan 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

## Abstract Given a bipartite graph __G__(__U__∪__V, E__) with __n__ vertices on each side, an independent set __I__∈__G__ such that |__U__∩__I__|=|__V__∩__I__| is called a balanced bipartite independent set. A balanced coloring of __G__ is a coloring of the vertices of __G__ such that each color c