Editors:
- Presents the latest research in the subject area, including significant new results obtained over recent years
- Illustrates various approaches, techniques and algorithms used in digraph theory
- Explores structural results as well as algorithms and complexity, including results on fixed parameter tractability
- Collects over 120 open problems and conjectures
Part of the book series: Springer Monographs in Mathematics (SMM)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (12 chapters)
-
Front Matter
-
Back Matter
About this book
This edited volume offers a detailed account of the theory of directed graphs from the perspective of important classes of digraphs, with each chapter written by experts on the topic.
Outlining fundamental discoveries and new results obtained over recent years, this book provides a comprehensive overview of the latest research in the field. It covers core new results on each of the classes discussed, including chapters on tournaments, planar digraphs, acyclic digraphs, Euler digraphs, graph products, directed width parameters, and algorithms. Detailed indices ease navigation while more than 120 open problems and conjectures ensure that readers are immersed in all aspects of the field.
Classes of Directed Graphs provides a valuable reference for graduate students and researchers in computer science, mathematics and operations research. As digraphs are an important modelling tool in other areas of research, this book will also be a useful resource to researchers working in bioinformatics, chemoinformatics, sociology, physics, medicine, etc.
Keywords
- directed graphs
- directed graphs classes
- tournaments generalizations
- planar digraphs
- acyclic digraphs
- Euler digraphs
- directed width parameters
- graph products
- orientations of graphs
- graph connectivity
- disjoint paths
- graph branchings
- hamiltonian paths
- hamiltonian cycles
- feedback sets
- algorithm analysis and problem complexity
Editors and Affiliations
-
Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark
Jørgen Bang-Jensen
-
Department of Computer Science, Royal Holloway, University of London, Egham, United Kingdom
Gregory Gutin
About the editors
Jørgen Bang-Jensen is a professor in the Department of Mathematics and Computer science at the University of Southern Denmark, Odense, Denmark.
Gregory Gutin is Professor of Computer Science at Royal Holloway College, University of London, UK.
Bibliographic Information
Book Title: Classes of Directed Graphs
Editors: Jørgen Bang-Jensen, Gregory Gutin
Series Title: Springer Monographs in Mathematics
DOI: https://doi.org/10.1007/978-3-319-71840-8
Publisher: Springer Cham
eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)
Copyright Information: Springer International Publishing AG, part of Springer Nature 2018
Hardcover ISBN: 978-3-319-71839-2Published: 03 July 2018
Softcover ISBN: 978-3-030-10122-0Published: 25 January 2019
eBook ISBN: 978-3-319-71840-8Published: 18 June 2018
Series ISSN: 1439-7382
Series E-ISSN: 2196-9922
Edition Number: 1
Number of Pages: XXII, 636
Number of Illustrations: 105 b/w illustrations, 4 illustrations in colour
Topics: Graph Theory, Discrete Mathematics in Computer Science, Algorithm Analysis and Problem Complexity