More than 1,900 Springer Protocols eBooks at just $9.99 each! Get yours today>>

Monographs in Theoretical Computer Science. An EATCS Series

Words and Graphs

Authors: Kitaev, Sergey, Lozin, Vadim

  • Self-contained survey, useful for learning and reference
  • Authors among key researchers in this field
  • Suggests problems and directions for further research
see more benefits

Buy this book

eBook 71,39 €
price for Spain (gross)
  • ISBN 978-3-319-25859-1
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover 88,39 €
price for Spain (gross)
  • ISBN 978-3-319-25857-7
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
Softcover 88,39 €
price for Spain (gross)
  • ISBN 978-3-319-35669-3
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
About this book

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. 

About the authors

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.

Reviews

“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)


Table of contents (9 chapters)

  • Introduction

    Kitaev, Sergey (et al.)

    Pages 1-6

    Preview Buy Chapter 30,19 €
  • Hereditary Classes of Graphs

    Kitaev, Sergey (et al.)

    Pages 7-30

    Preview Buy Chapter 30,19 €
  • What Word-Representable Graphs Are and Where They Come from

    Kitaev, Sergey (et al.)

    Pages 31-56

    Preview Buy Chapter 30,19 €
  • Characterization of Word-Representable Graphs in Terms of Semi-transitive Orientations

    Kitaev, Sergey (et al.)

    Pages 57-79

    Preview Buy Chapter 30,19 €
  • Various Results on Word-Representable Graphs

    Kitaev, Sergey (et al.)

    Pages 81-130

    Preview Buy Chapter 30,19 €

Buy this book

eBook 71,39 €
price for Spain (gross)
  • ISBN 978-3-319-25859-1
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover 88,39 €
price for Spain (gross)
  • ISBN 978-3-319-25857-7
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
Softcover 88,39 €
price for Spain (gross)
  • ISBN 978-3-319-35669-3
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Words and Graphs
Authors
Series Title
Monographs in Theoretical Computer Science. An EATCS Series
Copyright
2015
Publisher
Springer International Publishing
Copyright Holder
Springer International Publishing Switzerland
eBook ISBN
978-3-319-25859-1
DOI
10.1007/978-3-319-25859-1
Hardcover ISBN
978-3-319-25857-7
Softcover ISBN
978-3-319-35669-3
Series ISSN
1431-2654
Edition Number
1
Number of Pages
XVIII, 264
Number of Illustrations and Tables
137 illustrations in colour
Topics