The following pages link to (Q5450091):
Displaying 16 items.
- Sudoku rectangle completion (extended abstract) (Q322367) (← links)
- Critical sets for Sudoku and general graph colorings (Q393178) (← links)
- How does Sudoku acquire integral eigenvalues? (Q601781) (← links)
- A generalization of chromatic polynomial of a graph subdivision (Q690546) (← links)
- Comparison of probabilistic algorithms for analyzing the components of an affine algebraic variety (Q1644578) (← links)
- Spectrum of free-form Sudoku graphs (Q1738271) (← links)
- On the number of Sudoku squares (Q1783641) (← links)
- Integral free-form Sudoku graphs (Q1792058) (← links)
- Matroids arising from electrical networks (Q2122763) (← links)
- Electrical networks and hyperplane arrangements (Q2326914) (← links)
- Triangular Numbers, Gaussian Integers, and KenKen (Q2901257) (← links)
- A new algorithm for enumerating all possible Sudoku squares (Q3178156) (← links)
- (Q3533474) (← links)
- (Q3568149) (← links)
- (Q3595362) (← links)
- Sudoku number of graphs (Q6085209) (← links)
