Oriented chromatic number of grids is greater than 7

DOI10.1016/J.IPL.2011.10.019zbMATH Open1239.05063OpenAlexW2004852774MaRDI QIDQ413252FDOQ413252

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

gridsoriented coloringcombinatorial problem

Mathematics Subject Classification ID

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

Cites Work

• On the maximum average degree and the oriented chromatic number of a graph
• Handbook of Graph Theory
• On the oriented chromatic number of grids
• 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
• A note on the oriented chromatic number of grids
• On the oriented chromatic number of Halin graphs
• On the oriented chromatic number of graphs with given excess

Cited In (9)

• The oriented chromatic number of the hexagonal grid is 6
• Homomorphisms and colourings of oriented graphs: an updated survey
• Title not available (Why is that?)
• Oriented chromatic number of Cartesian products and strong products of paths
• 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
• The oriented chromatic number of Halin graphs
• Signed coloring of 2-dimensional grids
• On the pushable chromatic number of various types of grids

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413252)