Distinguishing Cartesian products of countable graphs
Discussiones Mathematicae Graph Theory2016Vol. 37(1), pp. 155–155
Citations Over TimeTop 10% of 2016 papers
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.
Related Papers
- → Prim�rzerlegung in Steinschen Algebren(1964)32 cited
- → On the Number of Countable Models of A Countable Superstable Theory(1973)27 cited
- → �ber unirationale Scharen auf algebraischen Mannigfaltigkeiten(1966)4 cited
- → Appendix: On Set Coverings in Cartesian Product Spaces(2006)2 cited
- → On well-covered Cartesian products(2017)