The distinguishing number and distinguishing chromatic number for posets
Preprint
Abstract
In this paper we introduce the concepts of the distinguishing number and the distinguishing chromatic number of a poset. For a distributive lattice $L$ and its set $Q_L$ of join-irreducibles, we use classic lattice theory to show that any linear extension of $Q_L$ generates a distinguishing 2-coloring of $L$. We prove general upper bounds for the distinguishing chromatic number and particular upper bounds for the Boolean lattice and for divisibility lattices. In addition, we show that the distinguishing number of any twin-free Cohen-Macaulay planar lattice is at most 2.
Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Breaking graph symmetries by edge colouringsJournal of Combinatorial Theory, Series B, 2017
- Distinguishing chromatic number of random Cayley graphsDiscrete Mathematics, 2017
- Bounds for Distinguishing Invariants of Infinite GraphsThe Electronic Journal of Combinatorics, 2017
- Edge motion and the distinguishing indexTheoretical Computer Science, 2017
- Infinite motion and 2-distinguishability of graphs and groupsJournal of Algebraic Combinatorics, 2014
- The Cost of 2-Distinguishing Cartesian PowersThe Electronic Journal of Combinatorics, 2013
- Bounds on the Distinguishing Chromatic NumberThe Electronic Journal of Combinatorics, 2009
- A Note on the Asymptotics and Computational Complexity of Graph DistinguishabilityThe Electronic Journal of Combinatorics, 1998
- Symmetry Breaking in GraphsThe Electronic Journal of Combinatorics, 1996
- Planar lattices are lexicographically shellableOrder, 1992