On the oriented chromatic number of grids
From MaRDI portal
Publication:1007541
DOI10.1016/S0020-0190(02)00405-2zbMATH Open1173.68604MaRDI QIDQ1007541FDOQ1007541
Authors: Guillaume Fertin, Arup Roychowdhury, André Raspaud 
Publication date: 23 March 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Recommendations
- A note on the oriented chromatic number of grids
- The chromatic number of oriented graphs
- On the chromatic number of an oriented matroid
- Grid representations and the chromatic number
- On the oriented chromatic number of dense graphs
- Oriented and injective oriented colourings of grid graphs
- On the pushable chromatic number of various types of grids
- A note on orientation and chromatic number of graphs
- On the 2-edge-coloured chromatic number of grids
- On the oriented chromatic number of graphs with given excess
Cites Work
- On the maximum average degree and the oriented chromatic number of a graph
- Good and semi-strong colorings of oriented planar graphs
- Colorings and girth of oriented planar graphs
- On universal graphs for planar oriented graphs of a given girth
- On deeply critical oriented graphs
- The chromatic number of oriented graphs
- Antisymmetric flows and strong colourings of oriented graphs
Cited In (28)
- The oriented chromatic number of the hexagonal grid is 6
- Complete oriented colourings and the oriented achromatic number
- Chromatic polynomials of oriented graphs
- Proper orientations and proper chromatic number
- On the oriented coloring of the disjoint union of graphs
- 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
- Oriented graph coloring
- A note on the oriented chromatic number of grids
- On the oriented chromatic number of Halin graphs
- Ordered coloring of grids and related graphs
- On the chromatic numbers of signed triangular and hexagonal grids
- Analogues of cliques for \((m,n)\)-colored mixed graphs
- 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
- \(P_{11}\)-coloring of oriented graphs
- 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
- The simple chromatic number of oriented graphs
- On the pushable chromatic number of various types of grids
- On nice and injective-nice tournaments
- Ordered coloring grids and related graphs
- Oriented colourings of graphs with maximum degree three and four
This page was built for publication: 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 Q1007541)
