Abstract
Part 1 Basic graph theory: graphs and degrees of vertices subgraphs, isomorphic graphs, trees. Part 2 Colourings of graphs: vertex colourings edge colourings decompositions and Hamilton cycles more decompositions. Part 3 Circuits and cycles: Eulerian circuits the Oberwolfach Problem infinite lattice graphs. Part 4 Extremal problems: a theorem of Turan cages Ramsey theory. Part 5 Counting: counting 1-factors Cayley's Spanning Tree formula more spanning trees. Part 6 Labelling graphs: magic graphs and graceful trees conservative graphs. Part 7 Applications and algorithms: spanning tree algorithms matchings in graphs, scheduling problems binary trees and prefix codes. Part 7 Drawings of graphs: planar graphs the four colour theorem the five colour theorem graphs and geometry. Part 8 Measurements of closeness to planarity: crossing number thickness and splitting number Heawood's Empire Problem. Part 9 Graphs on surfaces: rotations of graphs planar graphs revisited the genus of a graph.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
