Szczegóły publikacji
Opis bibliograficzny
Proper distinguishing arc-colourings of symmetric digraphs / Rafał KALINOWSKI, Monika PILŚNIAK // Applied Mathematics and Computation ; ISSN 0096-3003. — 2022 — vol. 421 art. no. 126939, s. 1–6. — Bibliogr. s. 6, Abstr. — Publikacja dostępna online od: 2022-01-24
Autorzy (2)
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 138922 |
|---|---|
| Data dodania do BaDAP | 2022-01-31 |
| Tekst źródłowy | URL |
| DOI | 10.1016/j.amc.2022.126939 |
| Rok publikacji | 2022 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Applied Mathematics and Computation |
Abstract
A symmetric digraph arises from a simple graph by substituting each edge by a pair of opposite arcs . An arc-colouring of is distinguishing if the only automorphism of preserving is the identity. We study four types of proper arc-colourings of corresponding to four definitions of adjacency of arcs. For each type, we investigate the distinguishing chromatic index of , i.e. the least number of colours in a distinguishing proper colouring of . We also determine tight bounds for chromatic indices of , i.e. for the least numbers of colours in each type of proper colourings. Colourings of arcs of a symmetric digraph are equivalent to colourings of halfedges of the graph , which have applications in computer science.