The distinguishing index of the Cartesian product of countable graphs

DOI10.26493/1855-3974.792.403MaRDI QIDQ4597478zbMATH OpenOpenAlexWikidataFDO

Authors Izak Broere, Monika Pilśniak

Publication date 13 December 2017

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

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

zbMATH Keywords

automorphismedge colouringinfinite graphdistinguishing indexinfinite dimensional hypercube

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Infinite graphs (05C63)

Recommendations

• The distinguishing index of the Cartesian product of finite graphs
• The distinguishing index of infinite graphs
• Precise bounds for the distinguishing index of the Cartesian product
• Distinguishing Cartesian products of countable graphs
• The optimal general upper bound for the distinguishing index of infinite graphs

Cited in

(9)

• Distinguishing tournaments with small label classes
• Precise bounds for the distinguishing index of the Cartesian product
• The distinguishing index of graphs with infinite minimum degree
• Distinguishing index of Kronecker product of two graphs
• On asymmetric colourings of claw-free graphs
• The distinguishing index of the Cartesian product of finite graphs
• The distinguishing index of infinite graphs
• Asymmetric edge-colorings of graphs with three colors
• A bound for the distinguishing index of regular graphs

This page was built for publication: The distinguishing index of the Cartesian product of countable graphs

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