Homomorphisms and oriented colorings of equivalence classes of oriented graphs
type: Item
instance of: scholarly article
title: Homomorphisms and oriented colorings of equivalence classes of oriented graphs
zbMATH Open document ID: 1032.05047
DOI: 10.1016/S0012-365X(03)00086-4
author: William F. Klostermeyer
author: Gary MacGillivray
published in: Discrete Mathematics
publication date: 2004-01-26T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 2032859
zbMATH Keywords: Oriented chromatic number
zbMATH Keywords: Graph homomorphism
zbMATH Keywords: Vertex pushing
MaRDI profile type: Publication
cites work: Automorphisms and enumeration of switching classes of tournaments
cites work: The effect of two cycles on the complexity of colourings by directed graphs
cites work: The Complexity of Colouring by Semicomplete Digraphs
cites work: On the maximum average degree and the oriented chromatic number of a graph
cites work: On the complexity of H-coloring
cites work: Duality and Polynomial Testing of Tree Homomorphisms
cites work: The Existence of Homomorphisms to Oriented Cycles
cites work: Pushing the cycles out of multipartite tournaments
cites work: Q4458214
cites work: Hamiltonicity and reversing arcs in digraphs
cites work: On the complexity of the general coloring problem
cites work: Q5585195
cites work: Colorings and girth of oriented planar graphs
cites work: Good and semi-strong colorings of oriented planar graphs
cites work: The chromatic number of oriented graphs
full work available at URL: s0012-365x(03)00086-4
OpenAlex ID: W2165426231
description: scientific article; zbMATH DE number 2032859