A note on the oriented chromatic number of grids
From MaRDI portal
Publication:834897
DOI10.1016/J.IPL.2004.06.014zbMATH Open1173.68614OpenAlexW2057216953MaRDI QIDQ834897FDOQ834897
Authors: Andrzej Szepietowski, Monika Targan 
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
Recommendations
Cites Work
- On the maximum average degree and the oriented chromatic number of a graph
- 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
- Title not available (Why is that?)
Cited In (14)
- The oriented chromatic number of the hexagonal grid is 6
- Homomorphisms and colourings of oriented graphs: an updated survey
- Oriented chromatic number of grids is greater than 7
- Oriented chromatic number of Cartesian products and strong products of paths
- Digraphs products
- On the oriented chromatic number of grids
- On the chromatic numbers of signed triangular and hexagonal grids
- Oriented chromatic number of Cartesian products \(P_m \square P_n\) and \(C_m \square P_n \)
- Grid representations and the chromatic number
- On the 2-edge-coloured chromatic number of grids
- 2-edge-colored chromatic number of grids is at most 9
- The oriented chromatic number of Halin graphs
- Oriented and injective oriented colourings of grid graphs
- Signed coloring of 2-dimensional grids
This page was built for publication: A note on the oriented chromatic number of grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834897)
