Abstract
A graph theoretic concept of interest, both from the theoretical and practical points of view, is that of covering. A vertex (edge) of a graph is said to cover the edges (vertices) with which it is incident.
The purest and most thouhgtful minds are those which love colour the most.
The Stones of Venice, II,v — John Ruskin
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
© 1992 Springer Science+Business Media New York
About this chapter
Cite this chapter
Foulds, L.R. (1992). Coverings and Colourings. In: Graph Theory Applications. Universitext. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-0933-1_8
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0933-1_8
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97599-3
Online ISBN: 978-1-4612-0933-1
eBook Packages: Springer Book Archive