Graphs & digraphs

by Chartrand, Gary

Type Book

Rate 0.0 /5

Details

Files

Reviews

Download

Title Statements

Full title :Graphs & digraphs / by Gary Chartrand, Linda Lesniak and Ping Zhang.

Summary

Graphs & Digraphs masterfully employs student-friendly exposition, clear proofs, abundant examples, and numerous exercises to provide an essential understanding of the concepts, theorems, history, and applications of graph theory. Fully updated and thoughtfully reorganized to make reading and locating material easier for instructors and students, the Sixth Edition of this bestselling, classroom-tested text:Adds more than 160 new exercisesPresents many new concepts, theorems, and examplesIncludes recent major contributions to long-standing conjectures such as the Hamiltonian Factorization Conjecture, 1-Factorization Conjecture, and Alspach's Conjecture on graph decompositionsSupplies a proof of the perfect graph theoremFeatures a revised chapter on the probabilistic method in graph theory with many results integrated throughout the textAt the end of the book are indices and lists of mathematicians' names, terms, symbols, and useful references. There is also a section giving hints and solutions to all odd-numbered exercises. A complete solutions manual is available with qualifying course adoption. Graphs & Digraphs, Sixth Edition remains the consummate text for an advanced undergraduate level or introductory graduate level course or two-semester sequence on graph theory, exploring the subject's fascinating history while covering a host of interesting problems and diverse applications.

Edition Statements

Publication Date:2015.
Edition:Sixth edition

Publication Statements

Publisher(s):Taylor and Francis, an imprint of Chapman and Hall/CRC
Place of Publication:Boca Raton, FL
Language:eng
Publication Date:2015.

The Physical Object

Description:1 online resource (640 pages) : : 343 illustrations

Edition Identifiers

ISBN:9781498735803, 1498735800
oclc:on1059036376
LC Classification:QA166
Dewey Decimal:511/.5

Chapter 1 Introduction -- chapter 2 Connected Graphs and Distance -- chapter 3 Trees -- chapter 4 Connectivity -- chapter 5 Eulerian Graphs -- chapter 6 Hamiltonian Graphs -- chapter 7 Digraphs -- chapter 8 Flows in Networks -- chapter 9 Automorphisms and Reconstruction -- chapter 10 Planar Graphs -- chapter 11 Nonplanar Graphs -- chapter 12 Matchings, Independence and Domination -- chapter 13 Factorization and Decomposition -- chapter 14 Vertex Colorings -- chapter 15 Perfect Graphs and List Colorings -- chapter 16 Map Colorings -- chapter 17 Edge Colorings -- chapter 18 Nowhere-Zero Flows, List Edge Colorings -- chapter 19 Extremal Graph Theory -- chapter 20 Ramsey Theory -- chapter 21 The Probabilistic Method.