A note on the oriented chromatic number of grids

DOI10.1016/j.ipl.2004.06.014zbMath1173.68614OpenAlexW2057216953MaRDI QIDQ834897

Monika Targan, Andrzej Szepietowski

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.06.014

zbMATH Keywords

gridscombinatorial problemsgraphsoriented coloring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (9)

Homomorphisms and colourings of oriented graphs: an updated survey ⋮ Oriented chromatic number of Cartesian products and strong products of paths ⋮ Unnamed Item ⋮ Oriented chromatic number of Cartesian products \(P_m \square P_n\) and \(C_m \square P_n \) ⋮ 2-edge-colored chromatic number of grids is at most 9 ⋮ Oriented chromatic number of grids is greater than 7 ⋮ Signed coloring of 2-dimensional grids ⋮ Digraphs Products ⋮ The oriented chromatic number of Halin graphs

Cites Work

• On the oriented chromatic number of grids
• On the maximum average degree and the oriented chromatic number of a graph
• Good and semi-strong colorings of oriented planar graphs
• Acyclic and oriented chromatic numbers of graphs
• The chromatic number of oriented graphs
• Oriented graph coloring
• Unnamed Item

This page was built for publication: A note on the oriented chromatic number of grids