discrete mathematics - n-rooks n-colors problem - Mathematics Stack Exchange

The problem goes as follows: $n$ colors are used to color the squares in a $n\times m$ chess board so that each color is used exactly $m$ times. Can you always place $n$ rooks on the board, so that

discrete mathematics - n-rooks n-colors problem - Mathematics Stack Exchange

combinatorics - Smallest $r$ for which there is an $r$-coloring of the grid wherein no two colors are adjacent more than once. - Mathematics Stack Exchange

Mathematics for Computer Science (MIT 6.042J)

60-odd YEARS of MOSCOW MATHEMATICAL OLYMPIADS

discrete mathematics - Hitori and graph connectivity - Mathematics Stack Exchange

Mathematical Circus

Catalan number - Wikipedia

Quantitative Structure–Selectivity Relationships in Enantioselective Catalysis: Past, Present, and Future

discrete geometry - Knight's tours in higher dimensions - MathOverflow

The Algorithm Design Manual

Olympiad Combinatorics, PDF, Combinatorics