✦ LIBER ✦

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

✍ Scribed by Levit, Vadim E.; Mandrescu, Eugen

Book ID: 122614064
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 390 KB
Volume: 161
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.01.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

✍ P. Mark Kayll 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 121 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

When isG2a König–Egerváry Graph?

✍ Vadim E. Levit, Eugen Mandrescu 📂 Article 📅 2012 🏛 Springer Japan 🌐 English ⚖ 195 KB

A Characterization of König–Egerváry Gra

A Characterization of König–Egerváry Graphs Using a Common Property of All Maximum Matchings

✍ Vadim E. Levit; Eugen Mandrescu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 181 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.