Abstract
A graph is usually represented as a set of points of the plane or space joined in pairs by a certain collection of arcs. The points are called vertices, and the arcs (although need not be drawn straight) are usually referred to as edges.
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
References
Euler, L.: Elementa doctrinae solidorum. Novi Commentarii academiae scientiarum Petropolitanae 4, 109–140 (1758). Opera Omnia: Series 1 26, 71–93
Kuratowski, K.: Sur le problème des courbes gauches en topologie. Fund. Math. 15, 271–283 (1930)
Stanley, R. P.: Acyclic orientations of graphs. Discrete Math. 5, 171–178 (1973)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Eğecioğlu, Ö., Garsia, A.M. (2021). Graphs, Chromatic Polynomials, and Acyclic Orientations. In: Lessons in Enumerative Combinatorics. Graduate Texts in Mathematics, vol 290. Springer, Cham. https://doi.org/10.1007/978-3-030-71250-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-030-71250-1_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-71249-5
Online ISBN: 978-3-030-71250-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)