| 1. | Formally, let be a bipartite graph with parts } and }.
|
| 2. | See Zarankiewicz problem for more on the extremal functions of bipartite graphs.
|
| 3. | In case of regular bipartite graphs, this equality holds.
|
| 4. | The charts numismatists produce to represent the production of coins are bipartite graphs.
|
| 5. | The maximum size bicluster is equivalent to maximum edge biclique in bipartite graph.
|
| 6. | After some iteration this procedure reveals a cluster structure in the bipartite graph.
|
| 7. | For the crossing number of the complete bipartite graph.
|
| 8. | Therefore, every modular graph is a bipartite graph.
|
| 9. | Isomorphic bipartite graphs have the same degree sequence.
|
| 10. | This is a special subdivision, as it always results in a bipartite graph.
|
