Oriented chromatic number of Cartesian products and strong products of paths

DOI10.7151/dmgt.2074zbMath1401.05111OpenAlexW2799433228MaRDI QIDQ1630938

Anna Nenca, Janusz Dybizbański

Publication date: 5 December 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2074

zbMATH Keywords

gridoriented coloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

Oriented chromatic number of Cartesian products \(P_m \square P_n\) and \(C_m \square P_n \) ⋮ On the oriented coloring of the disjoint union of graphs

Uses Software

• nauty
• Traces

Cites Work

• 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
• On the oriented chromatic number of grids
• On the maximum average degree and the oriented chromatic number of a graph
• Good and semi-strong colorings of oriented planar graphs
• The oriented chromatic number of Halin graphs
• Practical graph isomorphism. II.
• On the oriented chromatic number of graphs with given excess
• Oriented colouring of some graph products
• 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 and strong products of paths