✦ LIBER ✦

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

✍ Scribed by Jean-Marie Bourjolly; William R. Pulleyblank

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 787 KB
Volume: 24
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90273-d

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

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

An extension of the könig-egerváry prope

An extension of the könig-egerváry property to node-weighted bidirected graphs

✍ Jean-Marie Bourjolly 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 450 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.

Minimum node covers and 2-bicritical gra

Minimum node covers and 2-bicritical graphs

✍ W. R. Pulleyblank 📂 Article 📅 1979 🏛 Springer-Verlag 🌐 English ⚖ 672 KB

Capacities of graphs and 2-matchings

✍ G. Greco 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 385 KB

A graph G is symmetric with respect to a functional Fc(P) defined on the set of all the probability distributions on its vertex set if the distribution P\* maximizing Fa(P) is uniform on V(G). We show that the class of graphs which are symmetric for the functional appearing in the capacity formula o