Abstract
Chapters 3—5 study the notion of word-representable graphs. This chapter, based on [84, 90], provides a far-reaching generalization of the notion of a word-representable graph, namely that of a u-representable graph. Section 7.7 contains other ways, including another generalization, to define the notion of word-representability.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Kitaev, S., Lozin, V. (2015). Representing Graphs via Pattern-Avoiding Words. In: Words and Graphs. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Cham. https://doi.org/10.1007/978-3-319-25859-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-25859-1_6
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)