Distinguishing Cartesian products of countable graphs

DOI10.7151/dmgt.1902zbMath1354.05065OpenAlexW2418670818MaRDI QIDQ503675

Ehsan Estaji, Rafał Kalinowski, Wilfried Imrich, Monika Pilśniak, Thomas W. Tucker

Publication date: 23 January 2017

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1902

zbMATH Keywords

automorphismsCartesian productvertex coloringinfinite graphsdistinguishing numberweak Cartesian product

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15)

Related Items

THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH, Trees with distinguishing index equal distinguishing number plus one, Distinguishing numbers and distinguishing indices of oriented graphs, Improving upper bounds for the distinguishing index, Asymmetric colorings of products of graphs and digraphs, On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture, A note on computable distinguishing colorings, Number of distinguishing colorings and partitions, Precise bounds for the distinguishing index of the Cartesian product

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distinguishability of infinite groups and graphs
• Graph multiplication
• Cartesian powers of graphs can be distinguished by two labels
• A note on the asymptotic and computational complexity of graph distinguishability
• Symmetry breaking in graphs
• Distinguishing infinite graphs
• The distinguishing number of Cartesian products of complete graphs
• Über das schwache Kartesische Produkt von Graphen
• The Automorphism Group of a Product of Graphs
• Weak cartesian product of graphs
• Distinguishing Cartesian powers of graphs
• Distinguishing Cartesian powers of graphs