Copyright © 2006 Elsevier Ltd All rights reserved.
Tree coloring of distance graphs with a real interval set
Received 23 January 2006;
revised 26 January 2006.
Available online 13 March 2006.
Abstract
Let R be the set of real numbers and D be a subset of the positive real numbers. The distance graph G(R,D) is a graph with the vertex set R and two vertices x and y are adjacent if and only if |x−y|
D. In this work, the vertex arboricity (i.e., the minimum number of subsets into which the vertex set V(G) can be partitioned so that each subset induces an acyclic subgraph) of G(R,D) is determined for D being an interval between 1 and δ.
Keywords: Distance graph; Vertex arboricity; Tree coloring






E-mail Article
Add to my Quick Links

Cited By in Scopus (0)

{





