ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Applied Mathematics Letters
Volume 19, Issue 12, December 2006, Pages 1341-1344
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (136 K)

Article Toolbox
  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.aml.2006.01.017    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2006 Elsevier Ltd All rights reserved.

Tree coloring of distance graphs with a real interval set

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Liancui Zuoa, Qinglin Yua, b, Corresponding Author Contact Information, E-mail The Corresponding Author, E-mail The Corresponding Author and Jianliang Wuc

aCenter for Combinatorics, LPMC, Nankai University, Tianjin, 300071, China

bDepartment of Mathematics and Statistics, Thompson Rivers University, Kamloops, BC, Canada

cSchool of Mathematics, Shandong University, Jinan, 250100, China


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 |xy|set membership, variantD. 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

Article Outline

1. Introduction
2. Vertex arboricity of G(R,D)
Acknowledgements
References

Corresponding Author Contact InformationCorresponding author at: Center for Combinatorics, LPMC, Nankai University, Tianjin, 300071, China.

Applied Mathematics Letters
Volume 19, Issue 12, December 2006, Pages 1341-1344
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2009 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.