The distinguishing number and distinguishing chromatic number for posets

DOI10.1007/s11083-021-09583-2OpenAlexW3206472736MaRDI QIDQ2088064

Ann N. Trenk, Karen L. Collins

Publication date: 21 October 2022

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.09858

zbMATH Keywords

distributive latticeBirkhoff's theoremdistinguishing numberdistinguishing chromatic number

Mathematics Subject Classification ID

Order, lattices, ordered algebraic structures (06-XX)

Cites Work

• Unnamed Item
• Edge motion and the distinguishing index
• The distinguishing chromatic number
• Planar lattices are lexicographically shellable
• A note on the asymptotic and computational complexity of graph distinguishability
• The distinguishing number and distinguishing index of the lexicographic product of two graphs
• Proper distinguishing colorings with few colors for graphs with girth at least 5
• Combinatorics and commutative algebra.
• Symmetry breaking in graphs
• The cost of 2-distinguishing Cartesian powers
• Distinguishing chromatic number of random Cayley graphs
• Infinite motion and 2-distinguishability of graphs and groups
• Bounds for distinguishing invariants of infinite graphs
• Bounds on the distinguishing chromatic number
• Breaking graph symmetries by edge colourings
• The problem of the rooks and its applications
• χ_D(G), |Aut(G)|, and a variant of the motion lemma