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

Related topics

Related topics

15 relations
Approximation algorithmClique (graph theory)Degree (graph theory)Distributed algorithm
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Hall's and Kőnig's theorem in graphs and hypergraphs
 
Is this relevant?
2010
2010
Parameterizing from the extremes: Feasible parameterizations of some NP-Optimization problems [HBNI Th 22]
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
2 of Combinatorial Optimization : Packing and Covering
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?
1972
1972
On König's Theorem for infinite bipartite graphs
 
Is this relevant?