IsBipartite returns true if the graph G is bipartite and false otherwise. If a variable name P is specified, then this name is assigned a bipartition of the vertices as a list of lists.
A graph G is bipartite if its set of vertices can be partitioned into two sets, V1 and V2, such that every edge in G connects a vertex in V1 or V2 to a vertex in the other set.
K32 ≔ CompleteGraph⁡3,2
K32≔Graph 1: an undirected unweighted graph with 5 vertices and 6 edge(s)
G ≔ CycleGraph⁡5
G≔Graph 2: an undirected unweighted graph with 5 vertices and 5 edge(s)
Download Help Document
What kind of issue would you like to report? (Optional)