Oriented chromatic number of Cartesian products and strong products of paths
Work
Year: 2018
Type: article
Abstract: An oriented coloring of an oriented graph G is a homomorphism from G to H such that H is without selfloops and arcs in opposite directions.We shall say that H is a coloring graph.In this paper, we foc... more
Authors Janusz Dybizbański, Anna Nenca
Institution University of Gdańsk
Cites: 14
Cited by: 2
Related to: 10
FWCI: 0.173
Citation percentile (by year/subfield): 48.07
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond