Distinguishing Cartesian Products of Countable Graphs

Ehsan Estaji, et al. "Distinguishing Cartesian Products of Countable Graphs." Discussiones Mathematicae Graph Theory 37.1 (2017): 155-164. <http://eudml.org/doc/288086>.

@article{EhsanEstaji2017,
abstract = {The distinguishing number D(G) of a graph G is the minimum number of colors needed to color the vertices of G such that the coloring is preserved only by the trivial automorphism. In this paper we improve results about the distinguishing number of Cartesian products of finite and infinite graphs by removing restrictions to prime or relatively prime factors.},
author = {Ehsan Estaji, Wilfried Imrich, Rafał Kalinowski, Monika Pilśniak, Thomas Tucker},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {vertex coloring; distinguishing number; automorphisms; infinite graphs; Cartesian and weak Cartesian product; Cartesian product; weak Cartesian product},
language = {eng},
number = {1},
pages = {155-164},
title = {Distinguishing Cartesian Products of Countable Graphs},
url = {http://eudml.org/doc/288086},
volume = {37},
year = {2017},
}

TY - JOUR
AU - Ehsan Estaji
AU - Wilfried Imrich
AU - Rafał Kalinowski
AU - Monika Pilśniak
AU - Thomas Tucker
TI - Distinguishing Cartesian Products of Countable Graphs
JO - Discussiones Mathematicae Graph Theory
PY - 2017
VL - 37
IS - 1
SP - 155
EP - 164
AB - The distinguishing number D(G) of a graph G is the minimum number of colors needed to color the vertices of G such that the coloring is preserved only by the trivial automorphism. In this paper we improve results about the distinguishing number of Cartesian products of finite and infinite graphs by removing restrictions to prime or relatively prime factors.
LA - eng
KW - vertex coloring; distinguishing number; automorphisms; infinite graphs; Cartesian and weak Cartesian product; Cartesian product; weak Cartesian product
UR - http://eudml.org/doc/288086
ER -