Abstract
Many of our graphs in the previous chapters had the property that their point set V(G) decomposed into two disjoint sets X 1 and X 2 and every edge connected one point of X 1 to one of X 2. Such graphs are called bipartite graphs with bipartition X 1, X 2. A simple bipartite graph with bipartition X 1, X 2 where |X 1| = k, |X 2| = ℓ is called a complete bipartite graph and is denoted by K k,ℓ if every point of X 1 is adjacent to every point of X 2. For example, K 3,3 is the second Kuratowski graph.
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
© 1989 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Recski, A. (1989). The theorems of König and Menger. In: Matroid Theory and its Applications in Electric Network Theory and in Statics. Algorithms and Combinatorics, vol 6. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-22143-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-22143-3_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-22145-7
Online ISBN: 978-3-662-22143-3
eBook Packages: Springer Book Archive