A textbook of graph theory

From MaRDI portal





This introductory text contains chapters on Basic Results, Directed Graphs, Connectivity, Trees, Independent Sets and Matchings, Eulerian and Hamiltonian Graphs, Graph Colorings, Planarity, Triangulated Graphs, and Applications. In these chapters the authors present a selection of results pertaining to the various topics. They include, for example, some results on \(k\)-partite tournaments by Goddard et al., Sumner's result on claw-free graphs, the McKee and Toida characterization of Eulerian graphs, the result of Harary and Nash-Williams on graphs with a Hamiltonian line-graph, Fourier's proof of the characterizations of planar graphs by Wagner and Kuratowski, and the result of Gilmore and Hoffman an interval graphs. The list of references contains 123 items.




Cited in
(only showing first 100 items - show all)








This page was built for publication: A textbook of graph theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5917970)