Abstract
Numerous discrete structures can best be described using graphs. Furthermore, in countless applications graphs appear naturally. Thus graphs can well be considered to be the most important structure in discrete mathematics.
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
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Hougardy, S., Vygen, J. (2016). Graphs. In: Algorithmic Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-39558-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-39558-6_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-39557-9
Online ISBN: 978-3-319-39558-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)