Abstract
The main subject of this book, the class of word-representable graphs, belongs to a wide family of graph classes known as hereditary. In this chapter, we will take a little tour through the world of hereditary classes. In particular, we will survey basic results related to this notion and will introduce various hereditary classes pertinent to word-representable graphs. We start with a formal definition.
This is a preview of subscription content, log in via an institution to check access.
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). Hereditary Classes of 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_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-25859-1_2
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)