The following pages link to (Q4017176):
Displaying 14 items.
- On the distances between Latin squares and the smallest defining set size (Q510525) (← links)
- When is a partial Latin square uniquely completable, but not its completable product? (Q924972) (← links)
- Latin bitrades derived from groups (Q998355) (← links)
- Latin trades in groups defined on planar triangulations (Q1043843) (← links)
- On defining numbers of vertex colouring of regular graphs (Q1292860) (← links)
- Defining sets and uniqueness in graph colorings: A survey (Q1299076) (← links)
- Critical sets in nets and Latin squares (Q1333109) (← links)
- Defining sets in vertex colorings of graphs and latin rectangles (Q1356483) (← links)
- Critical sets in back circulant latin squares (Q1924299) (← links)
- A census of critical sets based on non-trivial autotopisms of Latin squares of order up to five (Q2131453) (← links)
- Partitioning 3-homogeneous Latin bitrades (Q2427434) (← links)
- Minimal homogeneous Latin trades (Q2501541) (← links)
- The theory and application of latin bitrades: A survey (Q3548561) (← links)
- On the Distances between Latin Squares and the Smallest Defining Set Size (Q5346574) (← links)
