Browsing Waterloo Research by Subject "bipartite graphs"
Now showing items 1-2 of 2
-
Concatenating Bipartite Graphs
(The Electronic Journal of Combinatorics, 2022)Let x, y E (0, 1], and let A, B, C be disjoint nonempty stable subsets of a graph G, where every vertex in A has at least x |B| neighbors in B, and every vertex in B has at least y|C| neighbors in C, and there are no edges ... -
Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree
(Wiley, 2022-09-07)Let H be a tree. It was proved by Rödl that graphs that do not contain H as an induced subgraph, and do not contain the complete bipartite graph Kt,t as a subgraph, have bounded chromatic number. Kierstead and Penrice ...