Which chessboards have a closed knight's tour within the cube?
DeMaio, Joe (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
DeMaio, Joe (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bell, George I. (2008)
Journal of Integer Sequences [electronic only]
Similarity:
Kerner, Richard (2008)
Computational & Mathematical Methods in Medicine
Similarity:
Caselli, F., Krattenthaler, C., Lass, B., Nadeau, P. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Erickson, Alejandro, Ruskey, Frank, Woodcock, Jennifer, Schurch, Mark (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ryohei Miyadera, Daisuke Minematsu, Satoshi Hashiba (2006)
Visual Mathematics
Similarity:
Paulus Gerdes (2013)
Visual Mathematics
Similarity:
Propp, James (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bell, George I., Hirschberg, Daniel S., Guerrero-García, Pablo (2007)
Integers
Similarity:
Dawson, Robert J. MacG., Doyle, Blair (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Yang, Winston C. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Marius Dorkenoo, Marie-Christine Eglin-Leclerc, Eric Rémila (2004)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We give a linear time algorithm which, given a simply connected figure of the plane divided into cells, whose boundary is crossed by some colored inputs and outputs, produces non-intersecting directed flow lines which match inputs and outputs according to the colors, in such a way that each edge of any cell is crossed by at most one line. The main tool is the notion of height function, previously introduced for tilings. It appears as an extension of the notion of potential of a flow...