Graph colouring for office blocks, 2005. ,
Every planar map is four colorable. part I: Discharging, Illinois J. Math, vol.21, pp.429-490, 1977. ,
Every planar map is four colorable. part II: Reducibility, Illinois J. Math, vol.21, pp.491-567, 1977. ,
On Crum's Problem, Journal of the London Mathematical Society, vol.1, issue.4, pp.285-287, 1947. ,
DOI : 10.1112/jlms/s1-22.4.285
Coloring rectangular blocks in 3-space, Discussiones Mathematicae Graph Theory, vol.31, issue.1, pp.161-170, 2011. ,
DOI : 10.7151/dmgt.1535
Painting the office Mathematics-in-Industry Case Studies Journal, pp.1-8, 2008. ,
Über nachbargebiete im raume, Monatshefte für Mathematik und Physik, pp.211-21610, 1905. ,
Famous problems of mathematics. Solved and unsolved mathematical problems from antiquity to modern times Authorized translation from the second, 1959. ,