## Selected Topics in Graph Theory, Volumes 1-3 |

### What people are saying - Write a review

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

### Contents

Eulerian Graphs | 17 |

Perfect Graphs | 55 |

Automorphism Groups of Graphs | 89 |

Copyright | |

6 other sections not shown

### Other editions - View all

### Common terms and phrases

adjacent algorithm Applications arcs automorphism group bound called Chapter characterization chromatic number circuit color Combinatorial Theory complete component condition conjecture connected consider construction contains corresponding covering defined definition denote determined digraph dimension directed discussed edges elements equal Erdős Eulerian graph Eulerian trail ex(n exactly example exists extension extremal graph fact finite following result function give given graph G Graph Theory Hamiltonian holds implies independent induced infinite graphs integer interesting interval joined labeled least length Let G linear London Math matrix maximum obtained pairs partition path perfect graph permutation planar plane poset positive possible probability problem proof proved question random graphs rank regular representation rooted satisfies shown simple Step studied subgraph subset Theorem transitive trees valency vertex vertices walk