Pages that link to "Item:Q2363696"
From MaRDI portal
The following pages link to Bounds for distinguishing invariants of infinite graphs (Q2363696):
Displaying 7 items.
- On symmetries of edge and vertex colourings of graphs (Q776279) (← links)
- Number of distinguishing colorings and partitions (Q776312) (← links)
- The distinguishing number and distinguishing chromatic number for posets (Q2088064) (← links)
- Trees with distinguishing index equal distinguishing number plus one (Q2175243) (← links)
- Distinguishing graphs of maximum valence 3 (Q2278113) (← links)
- Number of colors needed to break symmetries of a graph by an arbitrary edge coloring (Q5058213) (← links)
- Distinguishing threshold of graphs (Q6074586) (← links)
