Kőnig's theorem (graph theory)

Known as: König, König's theorem (graph theory), Koenig theorem (graph theory) 
In the mathematical area of graph theory, König's theorem, proved by Dénes Kőnig (), describes an equivalence between the maximum matching problem… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Parameterized complexity is a newly developed sub-area of computational complexity that allows for a more refined analysis of… (More)
  • table 1.1
  • figure 4.2
  • figure 4.3
  • figure 5.1
  • table 5.1
Is this relevant?
Review
2008
Review
2008
In this column we review the following books. (b) The congruences of a finite lattice: a proof-by picture approach Also by George… (More)
Is this relevant?