Skip to main content

Introduction

  • Chapter
  • First Online:
Book cover Words and Graphs
  • 1152 Accesses

Abstract

The core of our book is the theory of word-representable graphs, a young but very promising research area lying on the boundary of graph theory and combinatorics on words. This theory is discussed in Chapters 3{5, where we provide all necessary definitions and examples, as well as a proof of every statement we make along with references to the original sources.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Kitaev, S., Lozin, V. (2015). Introduction. In: Words and Graphs. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Cham. https://doi.org/10.1007/978-3-319-25859-1_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-25859-1_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-25857-7

  • Online ISBN: 978-3-319-25859-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics