Pages that link to "Item:Q2835392"
From MaRDI portal
The following pages link to Distinguishing graphs by total colourings (Q2835392):
Displaying 11 items.
- Number of distinguishing colorings and partitions (Q776312) (← links)
- Proper distinguishing arc-colourings of symmetric digraphs (Q2079126) (← links)
- Bounds for distinguishing invariants of infinite graphs (Q2363696) (← links)
- A note on breaking small automorphisms in graphs (Q2410241) (← links)
- 当24≤d≤34时圈的d-强全染色 (Q2984404) (← links)
- Generation of Colourings and Distinguishing Colourings of Graphs (Q3449807) (← links)
- Distinguishing number and distinguishing index of certain graphs (Q5020420) (← links)
- Number of colors needed to break symmetries of a graph by an arbitrary edge coloring (Q5058213) (← links)
- (Q5488328) (← links)
- Distinguishing threshold of graphs (Q6074586) (← links)
- Distinguishing tournaments with small label classes (Q6621241) (← links)