Abstract
For what follows, recall from Dffnition 3.2.3 that for a word-representable graph G, its representation number R(G) is the minimal k such that G is k-word-representable.
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). Various Results on Word-Representable Graphs. In: Words and Graphs. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Cham. https://doi.org/10.1007/978-3-319-25859-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-25859-1_5
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)