Pages that link to "Item:Q1385847"
From MaRDI portal
The following pages link to A note on the asymptotic and computational complexity of graph distinguishability (Q1385847):
Displayed 30 items.
- Endomorphism breaking in graphs (Q405090) (← links)
- Distinguishing Cartesian products of countable graphs (Q503675) (← links)
- Edge motion and the distinguishing index (Q526904) (← links)
- On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two (Q626859) (← links)
- Cartesian powers of graphs can be distinguished by two labels (Q854831) (← links)
- Destroying automorphisms by fixing nodes (Q856873) (← links)
- Local finiteness, distinguishing numbers, and Tucker's conjecture (Q888634) (← links)
- Distinguishing labeling of group actions (Q1024499) (← links)
- On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results (Q1044994) (← links)
- The list distinguishing number of Kneser graphs (Q1693128) (← links)
- A characterization of Johnson and Hamming graphs and proof of Babai's conjecture (Q1984524) (← links)
- Distinguishing index of maps (Q2011148) (← links)
- On the spectral gap and the automorphism group of distance-regular graphs (Q2033919) (← links)
- On asymmetric colourings of claw-free graphs (Q2048557) (← links)
- The distinguishing number and distinguishing chromatic number for posets (Q2088064) (← links)
- Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed (Q2153303) (← links)
- Infinite motion and 2-distinguishability of graphs and groups (Q2256057) (← links)
- Distinguishing graphs of maximum valence 3 (Q2278113) (← links)
- The distinguishing index of infinite graphs (Q2341071) (← links)
- Bounds for distinguishing invariants of infinite graphs (Q2363696) (← links)
- Breaking graph symmetries by edge colourings (Q2407385) (← links)
- The distinguishing number of Cartesian products of complete graphs (Q2427541) (← links)
- Distinguishing labellings of group action on vector spaces and graphs (Q2509274) (← links)
- Effective storage capacity of labeled graphs (Q2637317) (← links)
- Distinguishing number of hierarchical products of graphs (Q2662361) (← links)
- Generation of Colourings and Distinguishing Colourings of Graphs (Q3449807) (← links)
- Coarse distinguishability of graphs with symmetric growth (Q5013344) (← links)
- Distinguishing threshold of graphs (Q6074586) (← links)
- Asymmetric colouring of locally compact permutation groups (Q6096835) (← links)
- On the automorphism groups of rank-4 primitive coherent configurations (Q6144399) (← links)