Exploring Graph Theory, Part 2 |
Other editions - View all
Common terms and phrases
1-factor 4-colouring adjacent vertices algorithm bipartite graph boundary bridges chromatic number chromatic polynomial colours assigned common mesh complete graph contains contradiction corresponding crossing numbers crossing points cut-set cut-vertex degree sequence deleting diagonal dual edge in common edge-disjoint edges incident edges joining Euler's theorem Eulerian circuit Eulerian graph Eulerian path exterior region extra edge F regions four colour graph isomorphic graph of fig graph theory Hamiltonian circuit Hamiltonian graphs Hamiltonian path Harary homeomorphic induction integer Ks,s least monochromatic triangle multigraph non-planar graph number of edges number of regions number of vertices numbers assigned odd degree optimal drawing pair parallel edges Petersen graph planar graph polygon problem properly coloured prove randomly Eulerian resulting graph satisfies conditions Schlegel diagram second colour semi-Eulerian set of edges single edge six vertices spanning tree subgraph Suppose theorem is true total number V₂ vertices adjacent vertices of degree vertices of odd