Acyclic colorings of products of trees

Authors:
Robert E. Jamison;Gretchen L. Matthews;John Villalpando
Affiliations:
Department of Mathematical Sciences, Clemson University, Clemson, SC;Department of Mathematical Sciences, Clemson University, Clemson, SC;Department of Mathematics and Computer Sciences, Gonzaga University, Spokane, WA
Venue:
Information Processing Letters
Year:
2006

Citing 5
Cited 3

Designs and their codes

Designs and their codes
Labelling graphs with a condition at distance 2

SIAM Journal on Discrete Mathematics
On the $\lambda$-Number of $Q_n$ and Related Graphs

SIAM Journal on Discrete Mathematics
Acyclic and k-distance coloring of the grid

Information Processing Letters
Acyclic colorings of locally planar graphs

European Journal of Combinatorics - Special issue: Topological graph theory II

Acyclic coloring of graphs of maximum degree five: Nine colors are enough

Information Processing Letters
The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes

Discrete Applied Mathematics
A polyhedral study of the acyclic coloring problem

Discrete Applied Mathematics

Quantified Score

Hi-index	0.89

Visualization

Abstract

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).