Embedding into Bipartite Graphs
✍ Scribed by Böttcher, Julia; Heinig, Peter; Taraz, Anusch
- Book ID
- 118197089
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 2010
- Tongue
- English
- Weight
- 337 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0895-4801
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract Current graphs and a theorem of White are used to show the existence of almost complete regular bipartite graphs with quadrilateral embeddings conjectured by Pisanski. Decompositions of __K~n~__ and __K~n, n~__ into graphs with quadrilateral embeddings are discussed, and some thickness
For two integers a and b, we say that a bipartite graph G admits an (a, b)bipartition if G has a bipartition (X, Y ) such that |X| = a and |Y | = b. We say that two bipartite graphs G and H are compatible if, for some integers a and b, both G and H admit (a, b)-bipartitions. In this paper, we prove