Proper distinguishing arc-colourings of symmetric digraphs
type: Item
instance of: scholarly article
title: Proper distinguishing arc-colourings of symmetric digraphs
author: Rafał Kalinowski
author: Monika Pilśniak
published in: Applied Mathematics and Computation
publication date: 2022-03-04T00:00:00Z
Mathematics Subject Classification ID: 05C25
Mathematics Subject Classification ID: 05E18
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7484244
zbMATH Keywords: automorphism
zbMATH Keywords: symmetry breaking
zbMATH Keywords: distinguishing chromatic index
MaRDI profile type: Publication
full work available at URL: j.amc.2022.126939
OpenAlex ID: W4206952658
cites work: Symmetry breaking in graphs
cites work: Asymmetric trees with two prescribed degrees
cites work: Incidence and strong edge colorings of graphs
cites work: Regular orbits of permutation groups on the power set
cites work: The distinguishing chromatic number
cites work: Distinguishing views in symmetric networks: a tight lower bound
cites work: Labelled port graph -- a formal structure for models and computations
cites work: Destroying symmetry by orienting edges: Complete graphs and complete bigraphs
cites work: Identity orientation of complete bipartite graphs
cites work: The distinguishing index of connected graphs without pendant edges
cites work: Distinguishing graphs by edge-colourings
cites work: Distinguishing arc-colourings of symmetric digraphs
cites work: Distinguishing graphs by total colourings
cites work: Vertex-distinguishing proper arc colorings of digraphs
cites work: Distinguishing numbers and distinguishing indices of oriented graphs
cites work: Improving upper bounds for the distinguishing index
cites work: On the arc-chromatic number of a digraph
cites work: Q4869540
DOI: 10.1016/J.AMC.2022.126939
description: scientific article; zbMATH DE number 7484244