Asymmetric colorings of products of graphs and digraphs
Loading...
Date
Authors
Broere, Izak
Imrich, Wilfried
Kalinowski, Rafal
Pilśniak, Monika
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier
Abstract
We extend results about asymmetric colorings of finite Cartesian products of graphs to strong and direct products of graphs and digraphs. On the way we shorten proofs for the existence of prime factorizations of finite digraphs and characterize the structure of the automorphism groups of strong and direct products. The paper ends with results on asymmetric colorings of Cartesian products of finite and infinite digraphs.
Description
Keywords
Asymmetric colorings, Automorphisms, Strong products, Digraphs, Vertex coloring, Coloring, Directed graphs, Graphic methods, Set theory, Cartesian products of graphs, Direct products of graphs, Prime factorization, Products of graphs, Graph theory, Graphs
Sustainable Development Goals
Citation
Broere, I., Imrich, W., Kalinowski, R. et al. 2019, 'Asymmetric colorings of products of graphs and digraphs', Discrete Applied Mathematics, vol. 266, pp. 56-64.