The distinguishing index of the Cartesian product of finite graphs

DOI10.26493/1855-3974.909.0e1zbMath1370.05063OpenAlexW2464110472MaRDI QIDQ5357290

Monika Pilśniak, Aleksandra Gorzkowska, Rafał Kalinowski

Publication date: 14 September 2017

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.909.0e1

zbMATH Keywords

symmetry breakingedge colouringCartesian product of graphsdistinguishing index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Group actions on combinatorial structures (05E18)

Related Items

Distinguishing arc-colourings of symmetric digraphs, The distinguishing number and distinguishing index of the lexicographic product of two graphs, Distinguishing number and distinguishing index of strong product of two graphs, Asymmetric edge-colorings of graphs with three colors, A bound for the distinguishing index of regular graphs, The chromatic distinguishing index of certain graphs, Edge motion and the distinguishing index, Distinguishing index of Kronecker product of two graphs, The distinguishing index of connected graphs without pendant edges, Number of distinguishing colorings and partitions, Distinguishing number and distinguishing index of certain graphs, Precise bounds for the distinguishing index of the Cartesian product