Asymmetric colorings of products of graphs and digraphs

DOI10.1016/j.dam.2018.12.023zbMath1473.05083OpenAlexW2909297949WikidataQ128576158 ScholiaQ128576158MaRDI QIDQ2026319

Monika Pilśniak, Rafał Kalinowski, Izak Broere, Wilfried Imrich

Publication date: 19 May 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.12.023

zbMATH Keywords

automorphismsdirect productsCartesian productsvertex coloringsstrong productsasymmetric colorings

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• On the Cartesian skeleton and the factorization of the strong product of digraphs
• Distinguishing Cartesian products of countable graphs
• Finding the prime factors of strong direct product graphs in polynomial time
• Graph multiplication
• Regular orbits of permutation groups on the power set
• Asymmetrization of infinite trees
• Fixed elements of infinite trees
• Symmetry breaking in graphs
• The Cartesian product of graphs with loops
• Factoring directed graphs with respect to the cardinal product in polynomial time II
• Factoring directed graphs with respect to the cardinal product in polynomial time
• On Cartesian skeletons of graphs
• Asymmetric trees with two prescribed degrees
• Refinement properties for relational structures
• Cardinal multiplication of structures with a reflexive relation
• Distinguishing Cartesian powers of graphs