Words and Graphs
Autor Sergey Kitaev, Vadim Lozinen Limba Engleză Paperback – 23 aug 2016
After extensive introductory chapters that explain the context and consolidate the state of the art in this field, including a chapter on hereditary classes of graphs, the authors suggest a variety of problems and directions for further research, and they discuss interrelations of words and graphs in the literature by means other than word-representability.
The book is self-contained, and is suitable for both reference and learning, with many chapters containing exercises and solutions to seleced problems. It will be valuable for researchers and graduate and advanced undergraduate students in discrete mathematics and theoretical computer science, in particular those engaged with graph theory and combinatorics, and also for specialists in algebra.
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (1) | 645.71 lei 38-44 zile | |
| Springer – 23 aug 2016 | 645.71 lei 38-44 zile | |
| Hardback (1) | 657.05 lei 38-44 zile | |
| Palgrave MacMillan – 28 noi 2015 | 657.05 lei 38-44 zile |
Preț: 645.71 lei
Preț vechi: 807.14 lei
-20%
Puncte Express: 969
Preț estimativ în valută:
114.17€ • 134.72$ • 99.98£
114.17€ • 134.72$ • 99.98£
Carte tipărită la comandă
Livrare economică 09-15 aprilie
Specificații
ISBN-13: 9783319356693
ISBN-10: 3319356690
Pagini: 284
Ilustrații: XVIII, 264 p. 137 illus. in color.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.44 kg
Ediția:Softcover reprint of the original 1st edition 2015
Editura: Springer
Locul publicării:Cham, Switzerland
ISBN-10: 3319356690
Pagini: 284
Ilustrații: XVIII, 264 p. 137 illus. in color.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.44 kg
Ediția:Softcover reprint of the original 1st edition 2015
Editura: Springer
Locul publicării:Cham, Switzerland
V-ar putea interesa
-
-35%Preț: 687.70 lei1050.26 lei -
Combinatorial Commutative AlgebraEzra Miller-15%Preț: 626.52 lei737.07 lei -
Combinatorial Commutative AlgebraEzra Miller-15%Preț: 485.66 lei571.36 lei -
Winning SolutionsEdward Lozansky-15%Preț: 559.71 lei658.47 lei -
A First Course in Noncommutative RingsTsit-Yuen Lam-15%Preț: 565.45 lei665.23 lei -
A First Course in Noncommutative RingsTsit-Yuen LamPreț: 442.77 lei -
Basic MathematicsSerge LangPreț: 384.68 lei -
AlgebraWilliam A. Adkins-15%Preț: 580.75 lei683.24 lei -
Galois TheoryL. Schneps-19%Preț: 523.62 lei646.44 lei -
Abstract AlgebraDavid S. Dummit-18%Preț: 886.45 lei1081.03 lei -
AlgebraI. M. Gelfand-17%Preț: 390.41 lei470.37 lei -
Further Linear AlgebraT. S. BlythPreț: 257.34 lei -
A Course in EnumerationMartin Aigner-15%Preț: 525.86 lei618.66 lei
Cuprins
Introduction.- Hereditary Classes of Graphs.- What Word-Representable Graphs Are and Where They Come From.- Characterization of Word-Representable Graphs in Terms of Semi-transitive Orientations.- Various Results on Word-Representable Graphs.- Open Problems and Further Research Directions on Word-Representable Graphs.- Interrelations Between Words and Graphs in the Literature.- More on Interrelations Between Words and Graphs in the Literature.- App. A: Graph Theory Background.- App. B: Beyond Graph Theory Background.
Recenzii
“UK pioneers Kitaev (Univ. of Strathclyde) and Lozin (Univ. of Warwick) now provide a first monographic treatment. Advanced undergraduates (no previous background is required) will gain access to an almost brand-new research area still rife with open problems. Summing Up: Recommended. Upper-division undergraduates through professionals/practitioners.” (D. V. Feldman, Choice, Vol. 54 (1), September, 2016)
Notă biografică
Dr. Sergey Kitaev is a Reader in Combinatorics in the Department of Computer and Information Sciences of the University of Strathclyde. He studied at Novosibirsk State University, specializing in mathematical cybernetics, and received his Ph.D. from the University of Gothenburg in 2003. He has held visiting positions at the University of California, San Diego, the Sobolev Institute of Mathematics, and the Royal Swedish Academy of Sciences, and most recently he was an Associate Professor of Mathematics in Reykjavik University. He authored the (Springer) monograph "Patterns in Permutations and Words" in 2011. His research focuses on combinatorics, discrete analysis, graph theory, and formal languages.
Prof. Vadim Lozin is a Professor in the Mathematics Institute at the University of Warwick. He received his Ph.D. in theoretical informatics from the University of Nizhny Novgorod in 1995. He was a visiting professor at Rutgers University, and he has held academic and visiting positions in Russia, Sweden, Switerland, Portugal, Germany, Canada, Saudi Arabia and France. He is the Managing Editor of the (Elsevier) Electronic Notes in Discrete Mathematics, and an Associate Editor of the (Elsevier) journal Discrete Applied Mathematics. His research focuses on graph theory, combinatorics, and discrete mathematics.
Prof. Vadim Lozin is a Professor in the Mathematics Institute at the University of Warwick. He received his Ph.D. in theoretical informatics from the University of Nizhny Novgorod in 1995. He was a visiting professor at Rutgers University, and he has held academic and visiting positions in Russia, Sweden, Switerland, Portugal, Germany, Canada, Saudi Arabia and France. He is the Managing Editor of the (Elsevier) Electronic Notes in Discrete Mathematics, and an Associate Editor of the (Elsevier) journal Discrete Applied Mathematics. His research focuses on graph theory, combinatorics, and discrete mathematics.
Textul de pe ultima copertă
This is the first comprehensive introduction to the theory of word-representable graphs, a generalization of several classical classes of graphs, and a new topic in discrete mathematics.
After extensive introductory chapters that explain the context and consolidate the state of the art in this field, including a chapter on hereditary classes of graphs, the authors suggest a variety of problems and directions for further research, and they discuss interrelations of words and graphs in the literature by means other than word-representability.
The book is self-contained, and is suitable for both reference and learning, with many chapters containing exercises and solutions to seleced problems. It will be valuable for researchers and graduate and advanced undergraduate students in discrete mathematics and theoretical computer science, in particular those engaged with graph theory and combinatorics, and also for specialists in algebra.
After extensive introductory chapters that explain the context and consolidate the state of the art in this field, including a chapter on hereditary classes of graphs, the authors suggest a variety of problems and directions for further research, and they discuss interrelations of words and graphs in the literature by means other than word-representability.
The book is self-contained, and is suitable for both reference and learning, with many chapters containing exercises and solutions to seleced problems. It will be valuable for researchers and graduate and advanced undergraduate students in discrete mathematics and theoretical computer science, in particular those engaged with graph theory and combinatorics, and also for specialists in algebra.
Caracteristici
Self-contained survey, useful for learning and reference Authors among key researchers in this field Suggests problems and directions for further research