 |
|
What people are saying - Write a reviewWe haven't found any reviews in the usual places. Related books
Contents
7 other sections not shown Common terms and phrasesabstract dual adjacent algorithm Chapter chromatic index chromatic number chromatic polynomial colour complete bipartite graph complete graph component connected graph Corollary corresponding countable cube cutset of G cycle graph cycle matroid Deduce define denoted digraph edge in common edges joining edges of G elements Euler's formula Eulerian graph Eulerian trail Exercise genus geometric dual given graph G graph in Fig graph theory Hall's theorem Hamiltonian graph incident independent sets induction infinite graph isomorphic labelled tree least Let G Markov chain matrix maximum flow minimum number multiple edges non-planar Note null graph number of edges number of vertices partial transversal Petersen graph PG(k planar graph problem proof prove regular of degree Section set of edges shortest path shown in Fig simple graph simple planar graph spanning forest spanning tree strongly connected subsets tournament transversal matroid transversal theory vertex set vertices of degree vertices of G vw-disconnecting set Bibliographic information
|
