✦ LIBER ✦

When isG2a König–Egerváry Graph?

✍ Scribed by Vadim E. Levit, Eugen Mandrescu

Book ID: 120788738
Publisher: Springer Japan
Year: 2012
Tongue: English
Weight: 195 KB
Volume: 29
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-012-1196-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

König–Egerváry Graphs are Non-Edmonds

✍ P. Mark Kayll 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 121 KB

König-Egerváry graphs, 2-bicritical grap

König-Egerváry graphs, 2-bicritical graphs and fractional matchings

✍ Jean-Marie Bourjolly; William R. Pulleyblank 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 787 KB

Critical Independent Sets and König–Eger

Critical Independent Sets and König–Egerváry Graphs

✍ Vadim E. Levit; Eugen Mandrescu 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 182 KB

On maximum matchings in König–Egerváry g

On maximum matchings in König–Egerváry graphs

✍ Levit, Vadim E.; Mandrescu, Eugen 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 390 KB

Forbidden subgraphs and the König–Egervá

Forbidden subgraphs and the König–Egerváry property

✍ Bonomo, Flavia; Dourado, Mitre C.; Durán, Guillermo; Faria, Luerbio; Grippo, Luc 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 424 KB

Jacobi's identity and the König-Egerváry

Jacobi's identity and the König-Egerváry theorem

✍ Joseph P.S Kung 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 110 KB

The Krnig-Egervkry theorem, which asserts that the maximum size of a partial matching in a relation equals the minimum size of a separating set, is proved using Jacobrs identity relating complementary minors in a matrix and its adjugate.