Kőnig's theorem (graph theory) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Kőnig's theorem (graph theory)" in English language version.

refsWebsite

Global rank English rank

7ams.org

451^st place

277^th place

5archive.org

6^th place

4doi.org

2^nd place

3books.google.com

3^rd place

1unimi.it

9,889^th place

low place

1arxiv.org

69^th place

59^th place

1semanticscholar.org

11^th place

8^th place

ams.org

mathscinet.ams.org

Lovász & Plummer (1986), p. 270. Lovász, László; Plummer, M. D. (1986), Matching Theory, Annals of Discrete Mathematics, vol. 29, North-Holland, ISBN 0-444-87916-1, MR 0859549
Göös & Suomela (2014). Göös, Mika; Suomela, Jukka (2014), "No sublogarithmic-time approximation scheme for bipartite vertex cover", Distributed Computing, 27 (6): 435–443, arXiv:1205.4605, doi:10.1007/s00446-013-0194-z, MR 3280546, S2CID 13513566
Lovász & Plummer (1986), Theorem 1.4.17, pp. 37ff.. Lovász, László; Plummer, M. D. (1986), Matching Theory, Annals of Discrete Mathematics, vol. 29, North-Holland, ISBN 0-444-87916-1, MR 0859549
"Trivially", according to Lovász (1974). Lovász, László (1974), "Minimax theorems for hypergraphs", Hypergraph Seminar (Proc. First Working Sem., Ohio State Univ., Columbus, Ohio, 1972; dedicated to Arnold Ross), Lecture Notes in Mathematics, vol. 411, Berlin: Springer, pp. 111–126, doi:10.1007/BFb0066186, ISBN 978-3-540-06846-4, MR 0406862.
This is the perfect graph theorem of Lovász (1972) Lovász, László (1972), "Normal hypergraphs and the perfect graph conjecture", Discrete Mathematics, 2 (3): 253–267, doi:10.1016/0012-365X(72)90006-4, MR 0302480.
Lovász (1974). Lovász, László (1974), "Minimax theorems for hypergraphs", Hypergraph Seminar (Proc. First Working Sem., Ohio State Univ., Columbus, Ohio, 1972; dedicated to Arnold Ross), Lecture Notes in Mathematics, vol. 411, Berlin: Springer, pp. 111–126, doi:10.1007/BFb0066186, ISBN 978-3-540-06846-4, MR 0406862.
Lovász & Plummer (1986), p. 271. Lovász, László; Plummer, M. D. (1986), Matching Theory, Annals of Discrete Mathematics, vol. 29, North-Holland, ISBN 0-444-87916-1, MR 0859549

archive.org

Called a covering and a minimum covering respectively by Bondy & Murty (1976), p. 73. Bondy, J. A.; Murty, U. S. R. (1976), Graph Theory with Applications, North Holland, ISBN 0-444-19451-7.
Bondy & Murty (1976), p. 70. Bondy, J. A.; Murty, U. S. R. (1976), Graph Theory with Applications, North Holland, ISBN 0-444-19451-7.
Bondy & Murty (1976), Theorem 5.3, p. 74; Cook et al. (2011). Bondy, J. A.; Murty, U. S. R. (1976), Graph Theory with Applications, North Holland, ISBN 0-444-19451-7. Cook, William J.; Cunningham, William H.; Pulleyblank, William R.; Schrijver, Alexander (2011), Combinatorial Optimization, Wiley Series in Discrete Mathematics and Optimization, vol. 33, John Wiley & Sons, pp. 48–49, ISBN 9781118031391.
Bondy & Murty (1976), Lemma 5.3, p. 74. Bondy, J. A.; Murty, U. S. R. (1976), Graph Theory with Applications, North Holland, ISBN 0-444-19451-7.
Bondy & Murty (1976), pp. 74–75. Bondy, J. A.; Murty, U. S. R. (1976), Graph Theory with Applications, North Holland, ISBN 0-444-19451-7.

arxiv.org

Göös & Suomela (2014). Göös, Mika; Suomela, Jukka (2014), "No sublogarithmic-time approximation scheme for bipartite vertex cover", Distributed Computing, 27 (6): 435–443, arXiv:1205.4605, doi:10.1007/s00446-013-0194-z, MR 3280546, S2CID 13513566

books.google.com

Bondy & Murty (1976), Theorem 5.3, p. 74; Cook et al. (2011). Bondy, J. A.; Murty, U. S. R. (1976), Graph Theory with Applications, North Holland, ISBN 0-444-19451-7. Cook, William J.; Cunningham, William H.; Pulleyblank, William R.; Schrijver, Alexander (2011), Combinatorial Optimization, Wiley Series in Discrete Mathematics and Optimization, vol. 33, John Wiley & Sons, pp. 48–49, ISBN 9781118031391.
Storer (2001), Exercise 261, p. 342. Storer, J. A. (2001), An Introduction to Data Structures and Algorithms, Progress in Computer Science and Applied Logic Series, Springer, ISBN 9780817642532.
Cook et al. (2011). Cook, William J.; Cunningham, William H.; Pulleyblank, William R.; Schrijver, Alexander (2011), Combinatorial Optimization, Wiley Series in Discrete Mathematics and Optimization, vol. 33, John Wiley & Sons, pp. 48–49, ISBN 9781118031391.

doi.org

Göös & Suomela (2014). Göös, Mika; Suomela, Jukka (2014), "No sublogarithmic-time approximation scheme for bipartite vertex cover", Distributed Computing, 27 (6): 435–443, arXiv:1205.4605, doi:10.1007/s00446-013-0194-z, MR 3280546, S2CID 13513566
"Trivially", according to Lovász (1974). Lovász, László (1974), "Minimax theorems for hypergraphs", Hypergraph Seminar (Proc. First Working Sem., Ohio State Univ., Columbus, Ohio, 1972; dedicated to Arnold Ross), Lecture Notes in Mathematics, vol. 411, Berlin: Springer, pp. 111–126, doi:10.1007/BFb0066186, ISBN 978-3-540-06846-4, MR 0406862.
This is the perfect graph theorem of Lovász (1972) Lovász, László (1972), "Normal hypergraphs and the perfect graph conjecture", Discrete Mathematics, 2 (3): 253–267, doi:10.1016/0012-365X(72)90006-4, MR 0302480.
Lovász (1974). Lovász, László (1974), "Minimax theorems for hypergraphs", Hypergraph Seminar (Proc. First Working Sem., Ohio State Univ., Columbus, Ohio, 1972; dedicated to Arnold Ross), Lecture Notes in Mathematics, vol. 411, Berlin: Springer, pp. 111–126, doi:10.1007/BFb0066186, ISBN 978-3-540-06846-4, MR 0406862.

semanticscholar.org

api.semanticscholar.org

Göös & Suomela (2014). Göös, Mika; Suomela, Jukka (2014), "No sublogarithmic-time approximation scheme for bipartite vertex cover", Distributed Computing, 27 (6): 435–443, arXiv:1205.4605, doi:10.1007/s00446-013-0194-z, MR 3280546, S2CID 13513566

unimi.it

cesa-bianchi.di.unimi.it

Cesa-Bianchi (2020). Cesa-Bianchi, Nicolò (April 11, 2020), Matchings and the max-flow min-cut theorem (PDF)