We examine complexes of graphs with the important property of being bipartite. Recall that a graph G is bipartite if G contains no cycles of odd length. Equivalently, G admits a bipartition (U, W), meaning that the vertex set V can be partitioned into two stable subsets U and W.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). Bipartite Graphs. In: Simplicial Complexes of Graphs. Lecture Notes in Mathematics, vol 1928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75859-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-75859-4_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75858-7
Online ISBN: 978-3-540-75859-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)