A note on the oriented chromatic number of grids
From MaRDI portal
(Redirected from Publication:834897)
Recommendations
Cites work
- scientific article; zbMATH DE number 3342024 (Why is no real title available?)
- Acyclic and oriented chromatic numbers of graphs
- Good and semi-strong colorings of oriented planar graphs
- On the maximum average degree and the oriented chromatic number of a graph
- On the oriented chromatic number of grids
- Oriented graph coloring
- The chromatic number of oriented graphs
Cited in
(14)- Oriented and injective oriented colourings of grid graphs
- On the oriented chromatic number of grids
- The oriented chromatic number of the hexagonal grid is 6
- Digraphs products
- Homomorphisms and colourings of oriented graphs: an updated survey
- Oriented chromatic number of Cartesian products and strong products of paths
- Oriented chromatic number of grids is greater than 7
- Oriented chromatic number of Cartesian products \(P_m \square P_n\) and \(C_m \square P_n \)
- On the chromatic numbers of signed triangular and hexagonal grids
- 2-edge-colored chromatic number of grids is at most 9
- Signed coloring of 2-dimensional grids
- The oriented chromatic number of Halin graphs
- Grid representations and the chromatic number
- On the 2-edge-coloured chromatic number of 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)