Distinguishing arc-colourings of symmetric digraphs

DOI10.26493/2590-9770.1472.24bzbMath1502.05067OpenAlexW4297492371MaRDI QIDQ5058208

Monika Pilśniak, Rafał Kalinowski, Magdalena Prorok

Publication date: 19 December 2022

Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/2590-9770.1472.24b

zbMATH Keywords

symmetry breakingdistinguishing indexdistinguishing chromatic index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Group actions on combinatorial structures (05E18)

Related Items

Proper distinguishing arc-colourings of symmetric digraphs

Cites Work

• Unnamed Item
• Distinguishing graphs by edge-colourings
• The distinguishing chromatic number
• On the arc-chromatic number of a digraph
• Incidence and strong edge colorings of graphs
• On incidence coloring and star arboricity of graphs
• The star arboricity of graphs
• Symmetry breaking in graphs
• Distinguishing index of maps
• Proper distinguishing arc-colourings of symmetric digraphs
• A bound for the distinguishing index of regular graphs
• Labelled port graph -- a formal structure for models and computations
• Distinguishing views in symmetric networks: a tight lower bound
• Asymmetric trees with two prescribed degrees
• Improving upper bounds for the distinguishing index
• The distinguishing index of connected graphs without pendant edges
• The distinguishing index of the Cartesian product of finite graphs