Algorithmic graph theory
Alan Gibbons · 1985
Preface 1. Introducing graphs and algorithmic complexity 2. Spanning-trees, branchings and connectivity 3. Planar graphs 4. Networks and flows 5. Matchings 6. Eulerian and Hamiltonian tours 7. Colouring graphs 8. Graph problems and intractability Appendix Author Index Subject Index.