Abstract
Let be G = (V,E) an arbitrary finite graph, where E is the set of edges and V= {vk}k=1n the set of n vertices numbered from 1 to n in an arbitrary order. We write (vk,v1) = ek1∈E if the vertices vk,v1∈V are connected by an edge otherwise ek1∉E.
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.
Similar content being viewed by others
References
Heesch, H., Chromatic Reduction of the Triangulations Te, e=e5+e7, J. of Combinatorial Theory, Vol. 13, No. 1, 8/1972.
Heesch, H., Untersuchungen zum Vierfarbenproblem, B.I. Hochschulskriptum 8lO/8lOa/8lOb, Mannheim 1969.
Ore, O., The Four-Color Problem, Academic Press, New York, London 1967
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1973 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Dürre, K. (1973). An Algorithm for Coloring the Vertices of an Arbitrary Finite Graph. In: Deussen, P. (eds) GI. Gesellschaft für Informatik e.V. 2. Jahrestagung. Lecture Notes in Economics and Mathematical Systems, vol 78. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80732-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-80732-9_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06127-4
Online ISBN: 978-3-642-80732-9
eBook Packages: Springer Book Archive