Acyclic colorings of products of trees
From MaRDI portal
Publication:845661
DOI10.1016/j.ipl.2005.11.023zbMath1184.05043OpenAlexW2019307433MaRDI QIDQ845661
John Villalpando, Gretchen L. Matthews, Robert E. Jamison
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2005.11.023
Coloring of graphs and hypergraphs (05C15) Applications of graph theory to circuits and networks (94C15) Combinatorial codes (94B25) Graph operations (line graphs, products, etc.) (05C76)
Related Items (7)
Acyclic coloring of graphs of maximum degree five: nine colors are enough ⋮ Game chromatic number of Cartesian product graphs ⋮ On irreducible no‐hole L(2, 1)‐coloring of trees ⋮ Game coloring the Cartesian product of graphs ⋮ A polyhedral study of the acyclic coloring problem ⋮ On the acyclic chromatic number of Hamming graphs ⋮ The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Acyclic and \(k\)-distance coloring of the grid
- On acyclic colorings of planar graphs
- Acyclic colorings of locally planar graphs
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
- On acyclic colorings of graphs on surfaces
- Associative graph products and their independence, domination and coloring numbers
- Acyclic coloring of graphs
- Labelling Graphs with a Condition at Distance 2
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- Acyclic colorings of planar graphs
This page was built for publication: Acyclic colorings of products of trees
