Packing Chromatic Number of Distance Graphs

Details Packing Chromatic Number of Distance Graphs Packing Chromatic Number of Distance Graphs

2011-05-27

arxiv.org/abs/1105.5652v1

Computer Science

Discrete Mathematics

13 pages, 3 figures

Scientific paper

The packing chromatic number $\chi_{\rho}(G)$ of a graph $G$ is the smallest integer $k$ such that vertices of $G$ can be partitioned into disjoint classes $X_1, ..., X_k$ where vertices in $X_i$ have pairwise distance greater than $i$. We study the packing chromatic number of infinite distance graphs $G(Z, D)$, i.e. graphs with the set $Z$ of integers as vertex set and in which two distinct vertices $i, j \in Z$ are adjacent if and only if $|i - j| \in D$. In this paper we focus on distance graphs with $D = \{1, t\}$. We improve some results of Togni who initiated the study. It is shown that $\chi_{\rho}(G(Z, D)) \leq 35$ for sufficiently large odd $t$ and $\chi_{\rho}(G(Z, D)) \leq 56$ for sufficiently large even $t$. We also give a lower bound 12 for $t \geq 9$ and tighten several gaps for $\chi_{\rho}(G(Z, D))$ with small $t$.

Affiliated with

Also associated with

No associations

Rating

Packing Chromatic Number of Distance Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Packing Chromatic Number of Distance Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Packing Chromatic Number of Distance Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-49337