Proven in the classroom, Essential

Discrete Mathematics for Computer Science aims to teach mathematical reasoning as well as concepts and skills by stressing the art of proof.

Berkane, "Asymptotic expansion for the sum of inverses of arithmetical functions involving iterated logarithms," Applicable Analysis and

Discrete Mathematics, vol.

Roach, "Properties, isomorphismsand enumeration of 2-Quasi- Magic Sudoku grids",

Discrete Mathematics, 311(13), pp.1098-1110, 2011.

Cockayne, "Chessboard domination problems," Annals of

Discrete Mathematics, vol.

Pranzo, "Minimum dominating trail set for two-terminal series parallel graphs," Electronic Notes in

Discrete Mathematics, vol.

Uscumlic, "Collectives of automata in labyrinths,"

Discrete Mathematics and Applications, vol.

Kriston, "The median function on trees,"

Discrete Mathematics, Algorithms and Applications, vol.

SIAM Journal on

Discrete Mathematics, 26(1):177-192, 2012.

Johnsonbaugh,

Discrete Mathematics, Prentice-Hall, Inc., New Jersey, 1997.

Peroche, "Some problems about linear arboricity,"

Discrete Mathematics, vol.

Ken-ichi KAWARABAYASHI "Application of Advanced Graph Theory to

Discrete Mathematics and Theoretical Computer Science"