Pages that link to "Item:Q3119062"
From MaRDI portal
The following pages link to Distinguishing partitions and asymmetric uniform hypergraphs (Q3119062):
Displaying 7 items.
- Nordhaus-Gaddum theorem for the distinguishing chromatic number (Q396886) (← links)
- Number of distinguishing colorings and partitions (Q776312) (← links)
- The partition of a uniform hypergraph into pairs of dependent hyperedges (Q1356565) (← links)
- Distinguishing partitions of complete multipartite graphs (Q2810380) (← links)
- Number of colors needed to break symmetries of a graph by an arbitrary edge coloring (Q5058213) (← links)
- Distinguishing threshold of graphs (Q6074586) (← links)
- A note on asymmetric hypergraphs (Q6650722) (← links)