KnowraBipartite graphLinked fromLinked fromThe 35 pages that link to Bipartite graph, each with the reason it gives.All 35Broader topic 5Related 15Narrower topic 7Compared with 8Assignment problemNarrower topic: Agents and tasks form the two vertex sets; edges represent feasible assignments.Bipartite matchingNarrower topic: Its two vertex sets are the sides that a matching pairs.David GaleNarrower topic: Matching problems can be represented as selecting compatible edges between two groups.Hungarian algorithmNarrower topic: The algorithm's assignments are edges between two disjoint groups.Kőnig's theoremNarrower topic: The theorem applies precisely to graphs with this two-part structure.Dinitz theoremNarrower topic: Rows and columns form the two vertex classes in the graph model behind the proof.Stable matching problemNarrower topic: Two-sided matching problems represent possible partnerships as edges between distinct groups.