Introduction

We all have our problems. In this chapter I present some of my favourite ones in topological graph theory. Some of these come from a problem list [3] I have been maintaining at http://www.cems.uvm.edu/~archdeac/problems, others are new; all, I think, are interesting. A. N. Whitehead said ‘The “silly” question is the first intimation of some totally new development’; I hope that some of these questions are silly.

In Section 2 we give some problems on drawing graphs in the plane, including the number of crossings. Section 3 contains some classical problems on genus and on obstructions to embeddings. In Section 4 we turn our attention to finding cycles, factors and trees in embedded graphs. A look at colouring and flow problems is in Section 5, while Section 6 examines problems involving local planarity, also known as representativity. Section 7 then covers the thickness of graphs, book embeddings and planar covers. Other geometrical topics are studied in Section 8, and algorithmic problems in Section 9. We finish in Section 10 with a look at infinite graphs.

We give a small sample of open and (we hope) interesting problems in topological graph theory. You are invited to explore the literature, the web and your imagination for others.