Precise bounds for the distinguishing index of the Cartesian product

DOI10.1016/j.tcs.2017.05.004zbMath1371.05082OpenAlexW2616059925MaRDI QIDQ2357379

Aleksandra Gorzkowska, Monika Pilśniak

Publication date: 13 June 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.05.004

zbMATH Keywords

Cartesian productedge colouringdistinguishing index

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Distinguishing graphs by edge-colourings
• Distinguishing Cartesian products of countable graphs
• Cartesian powers of graphs can be distinguished by two labels
• Symmetry breaking in graphs
• The distinguishing number of Cartesian products of complete graphs
• Distinguishing colorings of Cartesian products of complete graphs
• SELF-STABILIZING MASTER–SLAVE TOKEN CIRCULATION AND EFFICIENT SIZE-COMPUTATION IN A UNIDIRECTIONAL RING OF ARBITRARY SIZE
• The distinguishing index of the Cartesian product of finite graphs
• The Automorphism Group of a Product of Graphs
• Near Optimal Leader Election in Multi-Hop Radio Networks
• Distinguishing Cartesian powers of graphs

This page was built for publication: Precise bounds for the distinguishing index of the Cartesian product