Abstract
The results of this chapter show the close interplay between the adjacency relation Γ and the incidence M, and yield beautiful applications to combinatorics. Section 9.1 deals with independence of points in a set of points of a graph, i.e., with their mutually being non-neighbors of each other, which can easily be characterized in terms of the adjacency Γ. We shall be interested in the biggest possible independent sets.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
9.5 References
Dulmage AL, Mendelsohn NS: Coverings of bipartite graphs. Canadian J. Math. 10 (1958) 517–534.
Gallai T: Über extreme Punkt- und Kantenmengen. Ann. Univ. Sci. Budapest, Eötvös Sect. Math. 2 (1959) 133–138.
Hall P: On representations of subsets. J. London Math. Soc. 10 (1935) 26–30.
König D: Graphen und Matrizen. Mat. Fiz. Lapok 38 (1931) 116–119.
Maghout K: Sur la détermination des nombres de stabilité et du nombre chromatique d’un graphe. C. R. Acad. Sci. Paris 248 (1959) 3522–3523.
Norman RZ, Rabin MO: An algorithm for a minimum cover of a graph. Proc. Amer. Math. Soc. 10 (1959) 315–319.
Schmidt G, StröHLEIN T: A boolean matrix iteration in timetable construction. Linear Algebra Appl. 15 (1976) 27–51.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schmidt, G., Ströhlein, T. (1993). Matchings and Coverings. In: Relations and Graphs. EATCS Monographs on Theoretical Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-77968-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-77968-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-77970-1
Online ISBN: 978-3-642-77968-8
eBook Packages: Springer Book Archive