Get Math Help

GET TUTORING NEAR ME!

By submitting the following form, you agree to Club Z!'s Terms of Use and Privacy Policy

    Bipartite Graph

    Illustration

    Illustration

    Alternate names
    Definition

    A bipartite graph, also called a bigraph, is a set of graph vertices decomposed into two disjoint sets such that no two graph vertices within the same set are adjacent. A bipartite graph is a special case of a k-partite graph with k = 2. The illustration above shows some bipartite graphs, with vertices in each graph colored based on to which of the two disjoint sets they belong. Bipartite graphs are equivalent to two-colorable graphs. All acyclic graphs are bipartite. A cyclic graph is bipartite iff all its cycles are of even length. Families of of bipartite graphs include 1. acyclic graphs (i.e., trees and forests), 2.

    Find the right fit or it’s free.

    We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.