Abstract
Definition 3.0.1. For a finite word w, A(w) denotes the set of letters occurring in w.
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). What Word-Representable Graphs Are and Where They Come from. In: Words and Graphs. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Cham. https://doi.org/10.1007/978-3-319-25859-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-25859-1_3
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)