Homomorphisms and colourings of oriented graphs: an updated survey
From MaRDI portal
Publication:279228
DOI10.1016/j.disc.2015.03.018zbMath1334.05046OpenAlexW2508099963MaRDI QIDQ279228
Publication date: 27 April 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2015.03.018
Related Items (33)
Oriented chromatic number of Cartesian products and strong products of paths ⋮ Plurigraph coloring and scheduling problems ⋮ Unnamed Item ⋮ Perfect orientation colorings of cubic graphs ⋮ On fractional version of oriented coloring ⋮ Unnamed Item ⋮ Oriented chromatic number of Cartesian products \(P_m \square P_n\) and \(C_m \square P_n \) ⋮ On homomorphisms of oriented graphs with respect to the push operation ⋮ On relative clique number of triangle-free planar colored mixed graphs ⋮ Orientation spectra of cubic graphs ⋮ 2-edge-colored chromatic number of grids is at most 9 ⋮ Analogues of cliques for \((m,n)\)-colored mixed graphs ⋮ On oriented cliques with respect to push operation ⋮ Coloring graphs in oriented coloring of cubic graphs ⋮ On deeply critical oriented cliques ⋮ Equitable oriented coloring ⋮ On the pushable chromatic number of various types of grids ⋮ Pushable chromatic number of graphs with maximum average degree at most \(\frac{14}{5}\) ⋮ Classes of intersection digraphs with good algorithmic properties ⋮ Triangle-free projective-planar graphs with diameter two: domination and characterization ⋮ A homomorphic polynomial for oriented graphs ⋮ On Chromatic Number of Colored Mixed Graphs ⋮ Pushable chromatic number of graphs with degree constraints ⋮ Oriented colourings of graphs with maximum degree three and four ⋮ Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs ⋮ Efficient computation of the oriented chromatic number of recursively defined digraphs ⋮ A study on oriented relative clique number ⋮ Signed coloring of 2-dimensional grids ⋮ Oriented cliques and colorings of graphs with low maximum degree ⋮ On the existence and non-existence of improper homomorphisms of oriented and $2$-edge-coloured graphs to reflexive targets ⋮ Chromatic polynomials of oriented graphs ⋮ Colourings of oriented connected cubic graphs ⋮ On the oriented coloring of the disjoint union of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Homomorphism bounds for oriented planar graphs of given minimum girth
- Oriented chromatic number of grids is greater than 7
- A note on the oriented chromatic number of grids
- Oriented colorings of triangle-free planar graphs
- On the oriented chromatic number of Halin graphs
- The 2-dipath chromatic number of Halin graphs
- Oriented vertex and arc colorings of outerplanar graphs
- Oriented colorings of 2-outerplanar graphs
- Oriented colorings of partial 2-trees
- On the oriented chromatic number of grids
- An oriented coloring of planar graphs with girth at least five
- On acyclic colorings of planar graphs
- Minimal oriented graphs of diameter 2
- 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
- Marking games and the oriented game chromatic number of partial \(k\)-trees
- Homomorphisms and oriented colorings of equivalence classes of oriented graphs
- Homomorphisms from sparse graphs with large girth.
- On universal graphs for planar oriented graphs of a given girth
- The dichromatic number of a digraph
- On deeply critical oriented graphs
- Erratum to ``The monadic second-order logic of graphs. VI: On several representations of graphs by relational structures
- The oriented chromatic number of Halin graphs
- An oriented 7-colouring of planar graphs with girth at least 7
- An oriented colouring of planar graphs with girth at least 4
- On arc-coloring of subcubic graphs
- Outerplanar and Planar Oriented Cliques
- Maximum Order of a Planar Oclique Is 15
- Oriented colouring of some graph products
- Acyclic and oriented chromatic numbers of graphs
- New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes
- Oriented vertex and arc colorings of partial 2-trees
- Forbidden Subgraph Colorings and the Oriented Chromatic Number
- The chromatic number of oriented graphs
- Analogues of cliques for oriented coloring
- Homomorphism bounds for oriented planar graphs
- On the oriented chromatic index of oriented graphs
- The Map-Coloring Game
- Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
- SOFSEM 2006: Theory and Practice of Computer Science
- Oriented graph coloring
- On an adjacency property of almost all graphs
- Competitive colorings of oriented graphs
- On the oriented game chromatic number
This page was built for publication: Homomorphisms and colourings of oriented graphs: an updated survey
