000 | a | ||
---|---|---|---|
999 |
_c33743 _d33743 |
||
008 | 250227b xxu||||| |||| 00| 0 eng d | ||
020 | _a9783030101220 | ||
082 |
_a511.5 _bBAN |
||
100 |
_aBang-Jensen, Jorgen _eed. |
||
245 | _aClasses of directed graphs | ||
260 |
_bSpringer, _c2018 _aCham : |
||
300 |
_a xxii, 635 p. ; _bill., _c24 cm |
||
365 |
_b109.99 _c€ _d93.20 |
||
490 | _aSpringer Monographs in Mathematics | ||
504 | _aIncludes bibliographical references and index. | ||
520 | _aThis edited volume offers a detailed account on 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. | ||
650 | _aCombinatorics and graph theory | ||
650 | _aDirected graphs classes | ||
650 | _aTournaments generalizations | ||
650 | _aEuler digraphs | ||
650 | _aAcyclic digraphs | ||
650 | _aDirected width parameters | ||
650 | _aGraph connectivity | ||
650 | _aDisjoint paths | ||
650 | _aHamiltonian cycles | ||
650 | _aFeedback sets | ||
700 |
_aGutin, Gregory _eed. |
||
942 |
_2ddc _cBK |