Distinguishing numbers and distinguishing indices of oriented graphs
From MaRDI portal
Publication:2197442
DOI10.1016/j.dam.2020.06.007zbMath1450.05075arXiv1910.12738OpenAlexW3034595766MaRDI QIDQ2197442
Publication date: 31 August 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.12738
automorphism groupcomplete bipartite graphoriented graphdistinguishing numberdistinguishing chromatic numberdistinguishing indexdistinguishing chromatic index
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (2)
Extremal graphs for the distinguishing index ⋮ Proper distinguishing arc-colourings of symmetric digraphs
Cites Work
- Unnamed Item
- Finite factors of Bernoulli schemes and distinguishing labelings of directed graphs
- Distinguishing graphs by edge-colourings
- Distinguishing Cartesian products of countable graphs
- The distinguishing chromatic number
- Cartesian powers of graphs can be distinguished by two labels
- On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results
- Automorphism free Latin square graphs
- The distinguishing number and distinguishing index of the lexicographic product of two graphs
- Identity orientation of complete bipartite graphs
- The distinguishing number of the hypercube
- Symmetry breaking in graphs
- Symmetry breaking in tournaments
- On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture
- Distinguishing number of countable homogeneous relational structures
- The distinguishing number of Cartesian products of complete graphs
- Distinguishing colorings of Cartesian products of complete graphs
- Symmetries of partial Latin squares
- Distinguishing number and distinguishing index of neighbourhood corona of two graphs
- On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach
- Destroying symmetry by orienting edges: Complete graphs and complete bigraphs
- Trivial Set-Stabilizers in Finite Permutation Groups
- Distinguishing Cartesian powers of graphs
- Distinguishing Cartesian powers of graphs
This page was built for publication: Distinguishing numbers and distinguishing indices of oriented graphs
