On the acyclic chromatic number of Hamming graphs

DOI10.1007/s00373-008-0798-4zbMath1213.05088OpenAlexW1999075790MaRDI QIDQ1014824

Gretchen L. Matthews, Robert E. Jamison

Publication date: 29 April 2009

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-008-0798-4

zbMATH Keywords

Hamming graphacyclic coloringCartesian product of graphsdistance 2 coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Related Items

New results on two hypercube coloring problems, A polyhedral study of the acyclic coloring problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a hypercube coloring problem
• Acyclic colorings of subcubic graphs
• Acyclic colorings of products of trees
• Acyclic and \(k\)-distance coloring of the grid
• The triply shortened binary Hamming code is optimal
• On acyclic colorings of planar graphs
• Acyclic colorings of locally planar graphs
• New bounds on a hypercube coloring problem.
• On acyclic colorings of graphs on surfaces
• New results on two hypercube coloring problems
• Associative graph products and their independence, domination and coloring numbers
• Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets
• Acyclic coloring of graphs
• Acyclic colorings of planar graphs