On the oriented chromatic number of grids
From MaRDI portal
Publication:1007541
DOI10.1016/S0020-0190(02)00405-2zbMath1173.68604MaRDI QIDQ1007541
Arup Roychowdhury, Guillaume Fertin, Andre Raspaud
Publication date: 23 March 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Related Items
Homomorphisms and colourings of oriented graphs: an updated survey ⋮ A note on the oriented chromatic number of grids ⋮ Oriented chromatic number of Cartesian products and strong products of paths ⋮ On the oriented chromatic number of Halin graphs ⋮ Unnamed Item ⋮ Oriented chromatic number of Cartesian products \(P_m \square P_n\) and \(C_m \square P_n \) ⋮ \(P_{11}\)-coloring of oriented graphs ⋮ 2-edge-colored chromatic number of grids is at most 9 ⋮ Analogues of cliques for \((m,n)\)-colored mixed graphs ⋮ On nice and injective-nice tournaments ⋮ Oriented chromatic number of grids is greater than 7 ⋮ On the pushable chromatic number of various types of grids ⋮ Oriented colourings of graphs with maximum degree three and four ⋮ Signed coloring of 2-dimensional grids ⋮ Chromatic polynomials of oriented graphs ⋮ Digraphs Products ⋮ The oriented chromatic number of Halin graphs ⋮ On the oriented coloring of the disjoint union of graphs
Cites Work
- Antisymmetric flows and strong colourings of oriented graphs
- 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
