3 ms·
right, so why are some of the vertices black and why are some of them red?
by zackattack 16y ago
right, so why are some of the vertices black and why are some of them red?
- Locke1689 16y agoIt's a single bipartite graph -- the requirement for a bipartite graph is that every vertex can be separated into two non-adjacent disjoint sets. Since the names of the sets are arbitrary I just named them "red" and "black." The color of the vertex represents the membership of its set.
- zackattack 16y agoRight... so why are the sets disjoint? Why are some vertices in the red set and others in the black set?
- zackattack 16y agolike is the bipartite graph a natural translation or is it something arbitrary you invented? because if it's arbitrary it's confusing because in the written description you mentioned you could from one edge to another so it doesn't seem like it would be a bipartite graph but simply a regular connected graph?
- dnautics 16y agoit's just a tool to help solve the problem. Kind of like the chessboard/dominoes thing. You could have just as easily formulated the problem on a go board. But having black and white squares on the chessboard makes the solution much, much easier to visualize.