✦ LIBER ✦

An Application of Rado's Theorem to Disjoint Matchings in Bipartite Graphs

✍ Scribed by Murty, U. S. R.

Book ID: 120096555
Publisher: Oxford University Press
Year: 1978
Tongue: English
Weight: 48 KB
Volume: s2-17
Category: Article
ISSN: 0024-6107
DOI: 10.1112/jlms/s2-17.2.193

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Combinatorics of perfect matchings in pl

Combinatorics of perfect matchings in plane bipartite graphs and application to tilings

✍ J.C. Fournier 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 737 KB

Let G be a plane bipartite graph which admits a perfect matching and with distinguished faces called holes. Let MG denote the perfect matchings graph: its vertices are the perfect matchings of G, two of them being joined by an edge, if and only if they di er only on an alternating cycle bounding a f

An Asymptotic Independence Theorem for t

An Asymptotic Independence Theorem for the Number of Matchings in Graphs

✍ Elmar Teufl; Stephan Wagner 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 172 KB

An addendum to the most vital edges of m

An addendum to the most vital edges of matching in a bipartite graph

✍ Volgenant, A. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 50 KB 👁 2 views

A generalization of Sperner’s theorem an

A generalization of Sperner’s theorem and an application to graph orientations

✍ Jianguo Qian; Konrad Engel; Wei Xu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 385 KB

An Application of P4-Free Graphs in Theo

An Application of P4-Free Graphs in Theorem-Proving

✍ SETH CHAIKEN; NEIL V. MURRAY; ERIK ROSENTHAL 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 775 KB

Parameterized Complexity Results for Gen

Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming

✍ Gutin, Gregory; Kim, Eun Jung; Soleimanfallah, Arezou; Szeider, Stefan; Yeo, And 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 490 KB