Proper distinguishing arc-colourings of symmetric digraphs

DOI10.1016/j.amc.2022.126939OpenAlexW4206952658MaRDI QIDQ2079126

Rafał Kalinowski, Monika Pilśniak

Publication date: 4 March 2022

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2022.126939

zbMATH Keywords

automorphismsymmetry breakingdistinguishing chromatic index

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Group actions on combinatorial structures (05E18)

Related Items (1)

Distinguishing arc-colourings of symmetric digraphs

Cites Work

• Unnamed Item
• Vertex-distinguishing proper arc colorings of digraphs
• Distinguishing graphs by edge-colourings
• The distinguishing chromatic number
• Regular orbits of permutation groups on the power set
• On the arc-chromatic number of a digraph
• Incidence and strong edge colorings of graphs
• Identity orientation of complete bipartite graphs
• Symmetry breaking in graphs
• Distinguishing numbers and distinguishing indices of oriented graphs
• Labelled port graph -- a formal structure for models and computations
• Distinguishing views in symmetric networks: a tight lower bound
• Distinguishing graphs by total colourings
• Asymmetric trees with two prescribed degrees
• Destroying symmetry by orienting edges: Complete graphs and complete bigraphs
• Improving upper bounds for the distinguishing index
• The distinguishing index of connected graphs without pendant edges
• Distinguishing arc-colourings of symmetric digraphs

This page was built for publication: Proper distinguishing arc-colourings of symmetric digraphs