Combinatorial theory and statistical des
๐
Article
๐
1989
๐
Elsevier Science
๐
English
โ 135 KB
Book announcements graph. 2-tell embeddings of graphs. The maximum genus of a graph. Chapter 5: Connectivity and networks. n-Connected and n-edge-connected graphs. Menger's theorem. Networks. The max-flow min-cut theorem. Applications of the max-flow mm-cut theorem. Chapter 6: Hamiltonian Graphs and