Oriented chromatic number of grids is greater than 7

DOI10.1016/j.ipl.2011.10.019zbMath1239.05063OpenAlexW2004852774MaRDI QIDQ413252

Anna Nenca, Janusz Dybizbański

Publication date: 4 May 2012

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

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

zbMATH Keywords

combinatorial problemgridsoriented coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

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 ⋮ On the pushable chromatic number of various types of grids ⋮ Signed coloring of 2-dimensional grids ⋮ The oriented chromatic number of Halin graphs

Cites Work

• A note on the oriented chromatic number of grids
• On the oriented chromatic number of Halin graphs
• 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
• On the oriented chromatic number of graphs with given excess
• Acyclic and oriented chromatic numbers of graphs
• The chromatic number of oriented graphs
• Handbook of Graph Theory
• Oriented graph coloring

This page was built for publication: Oriented chromatic number of grids is greater than 7