A graph whose vertex set partitions as V = A ⊔ B with every edge between A and B. Characterisation: no odd cycles (König). Models matching/assignment problems.
A graph whose vertex set partitions as V = A ⊔ B with every edge between A and B. Characterisation: no odd cycles (König). Models matching/assignment problems.