The number of distinguishing colorings of a Cartesian product graph

DOI10.2989/16073606.2023.2274580zbMATH Open1547.05079MaRDI QIDQ6558479

Saeid Alikhani, Mohammad Hadi Shekarriz

Publication date: 19 June 2024

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Number of distinguishing colorings and partitions
• The distinguishing number of the hypercube
• Symmetry breaking in graphs
• The distinguishing number of Cartesian products of complete graphs
• Asymmetric trees with two prescribed degrees
• Distinguishing Cartesian powers of graphs
• Distinguishing threshold of graphs

This page was built for publication: The number of distinguishing colorings of a Cartesian product graph