What do you think Izzy is doing right now? Emma wondered aloud. Not sitting in a bus filled with five-year-olds,” Harriet said, “praying one of them doesn't get bussick.

There were cameras covering car parks, offices, corridors and storage areas in the basement. Result. The security bods started watching as if their lives depended on it.

That was a great movie, ONG.

Determining whether a graph has a hamiltonian path or circuit is NP-complete [3]. The problem remains NP-complete for cubic planar graphs [3], for maximal planar graphs [9], and for planar digraphs [3]. It can be trivially solved in polynomial time for planar acyclic digraphs.