Graphs and digraphs. 3rd ed.

*(English)*Zbl 0890.05001
London: Chapman & Hall. x, 422 p. (1996).

Publisher’s description:

Graph theory is a major area of combinatorics and, during recent decades, graph theory has developed into a major area of mathematics. In addition to its growing interest and importance as a mathematical subject, it has applications to many fields, including computer science and chemistry. This is the third edition of the well known and popular text on graph theory. As with the preceeding editions (see Zbl 0403.05027 and Zbl 0666.05001), the text presents graph theory as a mathematical discipline and emphasizes clear exposition and well written proofs. “Graphs and digraphs” includes many original and innovative exercises. New to the third edition are expanded treatments of graph decomposition and extremal graph theory; a study of graph vulnerability and domination; and introductions to voltage graphs, graph labelings, and the probabilistic method in graph theory. “Graphs and digraphs” is written for advanced undergraduates and graduate students. The book will be valued by mathematicians with an interest in graph theory, combinatorics, and discrete mathematics as well as by computer scientists and chemists, and only requires mathematical maturity for an understanding and appreciation of the material.

Graph theory is a major area of combinatorics and, during recent decades, graph theory has developed into a major area of mathematics. In addition to its growing interest and importance as a mathematical subject, it has applications to many fields, including computer science and chemistry. This is the third edition of the well known and popular text on graph theory. As with the preceeding editions (see Zbl 0403.05027 and Zbl 0666.05001), the text presents graph theory as a mathematical discipline and emphasizes clear exposition and well written proofs. “Graphs and digraphs” includes many original and innovative exercises. New to the third edition are expanded treatments of graph decomposition and extremal graph theory; a study of graph vulnerability and domination; and introductions to voltage graphs, graph labelings, and the probabilistic method in graph theory. “Graphs and digraphs” is written for advanced undergraduates and graduate students. The book will be valued by mathematicians with an interest in graph theory, combinatorics, and discrete mathematics as well as by computer scientists and chemists, and only requires mathematical maturity for an understanding and appreciation of the material.

##### MSC:

05-01 | Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics |

05Cxx | Graph theory |

05C20 | Directed graphs (digraphs), tournaments |

05C10 | Planar graphs; geometric and topological aspects of graph theory |

05C15 | Coloring of graphs and hypergraphs |

05C05 | Trees |

05C25 | Graphs and abstract algebra (groups, rings, fields, etc.) |

05C30 | Enumeration in graph theory |

05C35 | Extremal problems in graph theory |

05C38 | Paths and cycles |

05C40 | Connectivity |

05C45 | Eulerian and Hamiltonian graphs |

05C50 | Graphs and linear algebra (matrices, eigenvalues, etc.) |

05C55 | Generalized Ramsey theory |

05C60 | Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) |

05C99 | Graph theory |