Definition:Bipartite Graph/Partite Set
Jump to navigation
Jump to search
Definition
Let $G = \struct {A \mid B, E}$ be a bipartite graph.
Then $A$ and $B$ are called the partite sets of $G$.
Sources
- 2008: John M. Harris, Jeffry L. Hirst and Michael J. Mossinghoff: Combinatorics and Graph Theory (2nd ed.): $\S 1.1$