Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

5

IPL
2006

favoriteEmaildiscussreport

72views more IPL 2006»

Acyclic colorings of products of trees

13 years 4 months ago

Acyclic colorings of products of trees

Download www.math.clemson.edu

We obtain bounds for the coloring numbers of products of trees for three closely related types of colorings: acyclic, distance 2, and L(2, 1).

Robert E. Jamison, Gretchen L. Matthews, John Vill

Real-time Traffic

IPL 2006 | Related Types |

claim paper

Related Content

» On the Acyclic Chromatic Number of Hamming Graphs

» Acyclic and Star Colorings of Cographs

» Game coloring the Cartesian product of graphs

» Fractional Vertex Arboricity of Graphs

» Constraint Satisfaction Problems with Infinite Templates

» On the packing chromatic number of Cartesian products hexagonal lattice and trees

» maxcut and Containment Relations in Graphs

» Discriminative Learning of Relaxed Hierarchy for Largescale Visual Recognition

» Measuring Web Application Quality with WebQEM

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	IPL
Authors	Robert E. Jamison, Gretchen L. Matthews, John Villalpando

Comments (0)