The following pages link to (Q4552244):
Displaying 14 items.
- On the distances between Latin squares and the smallest defining set size (Q510525) (← links)
- Latin trades on three or four rows (Q856846) (← links)
- Sudoku in mathematics lessons (Q873914) (← links)
- On defining numbers of vertex colouring of regular graphs (Q1292860) (← links)
- On the forced matching numbers of bipartite graphs (Q1827691) (← links)
- Defining sets for Latin squares given that they are based on groups (Q1869037) (← links)
- A census of critical sets based on non-trivial autotopisms of Latin squares of order up to five (Q2131453) (← links)
- On the computational complexity of defining sets (Q2387433) (← links)
- Generalized Latin squares and their defining sets (Q2427495) (← links)
- What is the size of the smallest Latin square for which a weakly completable critical set of cells exists? (Q2761047) (← links)
- (Q4470233) (← links)
- (Q4681993) (← links)
- Defining Sets and Critical Sets in (0,1)‐Matrices (Q4929282) (← links)
- Bounds and monotonicity of critical set parameters of colourings (Q6542052) (← links)
