4. Drawing bipartite arrangements
Bipartite drawings are analogous to linear drawings in that the x-coordinate of the vertices are the same in both, but they can only be drawn for bipartite graphs since vertices need to have a y-coordinate (y=0 or y=1) which depends on the vertex partition they belong to. In this context, the vertex partitions of a graph should be understood as the sets of vertices defined by the colors of a legal coloring of the graph (no two adjacent vertices can have the same color) with the least number of colors possible. In a bipartite graph, only two vertex partitions are required.
Bipartite arrangements are specified in the same way linear and circular arrangements are specified. You only need a head vector (or an edge list), tick the corresponding checkbox, and , optionally, an arrangement or inverse linear arrangement.
The following input
produces the output (which has been rearranged)
Vertices in both drawings have the same x-coordinate. The y-coordinate depends on the color of the vertices in the aforementioned vertex coloring with just two colors (red and green). Since we are drawing a tree, such coloring exists.