Distinguishing Cartesian products of countable graphs

DOI10.7151/DMGT.1902zbMATH Open1354.05065OpenAlexW2418670818MaRDI QIDQ503675FDOQ503675

Authors: Ehsan Estaji, Wilfried Imrich, Rafał Kalinowski, 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

Recommendations

• The distinguishing number of Cartesian products of complete graphs
• Distinguishing infinite graphs
• Distinguishing Cartesian powers of graphs
• Distinguishing Cartesian powers of graphs
• Distinguishing chromatic number of Cartesian products of graphs

zbMATH Keywords

automorphismsCartesian productinfinite graphsvertex coloringdistinguishing numberweak Cartesian product

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (29)

• The distinguishing index of the Cartesian product of countable graphs
• Endomorphism breaking in graphs
• Distinguishing number and adjacency properties
• On distinquishing numbers
• Distinguishing colorings of Cartesian products of complete graphs
• Distinguishing numbers and distinguishing indices of oriented graphs
• Distinguishing chromatic number of Cartesian products of graphs
• 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
• The cost number and the determining number of a graph
• Precise bounds for the distinguishing index of the Cartesian product
• Distinguishing number of countable homogeneous relational structures
• The distinguishing number of Cartesian products of complete graphs
• Distinguishing number of hierarchical products of graphs
• Distinguishing graphs of maximum valence 3
• Game distinguishing numbers of Cartesian products
• Number of distinguishing colorings and partitions
• The distinguishing number of Kronecker product of two graphs
• Distinguishing numbers of Cartesian products of multiple complete graphs
• Improving upper bounds for the distinguishing index
• Distinguishing Cartesian powers of graphs
• Distinguishing Cartesian powers of graphs
• Recognizing triangulated Cartesian graph products
• Cartesian powers of graphs can be distinguished by two labels
• List-distinguishing Cartesian products of cliques
• The distinguishing index of the Cartesian product of finite graphs
• Trees with distinguishing index equal distinguishing number plus one
• The number of distinguishing colorings of a Cartesian product graph

This page was built for publication: Distinguishing Cartesian products of countable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q503675)