Oriented chromatic number of Cartesian products \(P_m \square P_n\) and \(C_m \square P_n \)
From MaRDI portal
Publication:2151213
DOI10.7151/dmgt.2307zbMath1498.05104OpenAlexW3008724417MaRDI QIDQ2151213
Publication date: 1 July 2022
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2307
Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Homomorphisms and colourings of oriented graphs: an updated survey
- Oriented chromatic number of grids is greater than 7
- A note on the oriented chromatic number of grids
- On the oriented chromatic number of Halin graphs
- Oriented vertex and arc colorings of outerplanar graphs
- On the oriented chromatic number of grids
- An oriented coloring of planar graphs with girth at least five
- On the maximum average degree and the oriented chromatic number of a graph
- Good and semi-strong colorings of oriented planar graphs
- Oriented chromatic number of Cartesian products and strong products of paths
- Hamiltonian cycles in hypercubes with \(2n-4\) faulty edges
- The oriented chromatic number of Halin graphs
- On the oriented chromatic number of graphs with given excess
- Acyclic and oriented chromatic numbers of graphs
- The chromatic number of oriented graphs
- Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs
- Oriented graph coloring
This page was built for publication: Oriented chromatic number of Cartesian products \(P_m \square P_n\) and \(C_m \square P_n \)