Number of distinguishing colorings and partitions

DOI10.1016/j.disc.2020.111984zbMath1443.05057arXiv1910.12102OpenAlexW2981948647MaRDI QIDQ776312

Mohammad Hadi Shekarriz, Bahman Ahmadi, Fatemeh Alinaghipour

Publication date: 8 July 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

distinguishing coloringdistinguishing coloring partitiondistinguishing partitiondistinguishing threshold

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Number of colors needed to break symmetries of a graph by an arbitrary edge coloring ⋮ Distinguishing number of hierarchical products of graphs ⋮ Distinguishing threshold of graphs

Cites Work

• Unnamed Item
• Distinguishing graphs by edge-colourings
• Distinguishing Cartesian products of countable graphs
• The distinguishing chromatic number
• Asymmetrising sets in trees
• The distinguishing number and distinguishing index of the lexicographic product of two graphs
• The distinguishing number of the hypercube
• Symmetry breaking in graphs
• Bounds for distinguishing invariants of infinite graphs
• Distinguishing infinite graphs
• The distinguishing number of Cartesian products of complete graphs
• Distinguishing labellings of group action on vector spaces and graphs
• Graph Theory
• Distinguishing graphs by total colourings
• Distinguishing partitions and asymmetric uniform hypergraphs
• Asymmetric trees with two prescribed degrees
• The distinguishing index of the Cartesian product of finite graphs
• The group of an X-join of graphs
• Distinguishing Cartesian powers of graphs
• The lexicographic product of graphs

This page was built for publication: Number of distinguishing colorings and partitions