## Introduction to the theory of graphs |

### From inside the book

Try this search over all volumes: **inauthor:"Mehdi Behzad"**

Results 1-0 of 0

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

GRAPHS AND SUBGRAPHS | 1 |

CONNECTED AND DISCONNECTED GRAPHS | 20 |

EULERIAN GRAPHS | 33 |

Copyright | |

8 other sections not shown

### Common terms and phrases

1-factor 4-coloring acyclic adjacency matrix belongs bipartite graph chromatic number complete graph component of G connected graph consider contradiction Corollary cubic graph cut-vertex of G cut-vertices cycle of G define deleting denote determine disconnected edge-disjoint edges of G eigenvalues elements embedded eulerian circuit eulerian graph follows Four Color Problem G contains G E(H G is connected G of order G V(G G1 and G2 genus graph G graph of order graph theory hamiltonian cycle hamiltonian graphs homeomorphic implies induced subgraph isomorphic least Math minimum number multigraph n-connected nonempty graph nontrivial connected graph number of edges number of vertices obtained outerplanar paths in G planar graph plane positive integer PROBLEM SET Prove randomly eulerian region of G regular graph result subgraph of G subgraphs G subset Suppose Theorem triangle vertex of degree vertex set vertices of G