✦ LIBER ✦

On cuts and matchings in planar graphs

✍ Scribed by Francisco Barahona

Publisher: Springer-Verlag
Year: 1993
Tongue: English
Weight: 877 KB
Volume: 60
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01580600

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extending matchings in planar graphs IV

✍ Michael D. Plummer 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 973 KB

Plummer, M.D., Extending matchings in planar graphs IV, Discrete Mathematics 109 (1992) 207-219. The structure of certain non-Zextendable planar graphs is studied first. In particular, 4-connected S-regular planar graphs which are not 2-extendable are investigated and examples of these are presented

Extending matchings in planar graphs V

✍ Michael D. Plummer 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 473 KB

A graph G on at least 2n + 2 vertices in n-extendable if every set of n independent edges extends to (i.e., is a subset of) a perfect matching in G. It is known that no planar graph is 3-extendable. In the present paper we continue to study 2-extendability in the plane. Suppose independent edges el

The complexity of the matching-cut probl

The complexity of the matching-cut problem for planar graphs and other graph classes

✍ Paul Bonsma 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB

## Abstract The Matching‐Cut problem is the problem to decide whether a graph has an edge cut that is also a matching. Previously this problem was studied under the name of the Decomposable Graph Recognition problem, and proved to be ${\cal{NP}}$‐complete when restricted to graphs with maximum deg

Maximum matchings in planar graphs via g

Maximum matchings in planar graphs via gaussian elimination

✍ Marcin Mucha; Piotr Sankowski 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 910 KB

Efficient Algorithms fork-Terminal Cuts

Efficient Algorithms fork-Terminal Cuts on Planar Graphs

✍ Danny Z. Chen; Xiadong Wu 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 285 KB

Matchings and walks in graphs

✍ C. D. Godsil 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 527 KB

## Abstract The matching polynomial α(__G, x__) of a graph __G__ is a form of the generating function for the number of sets of __k__ independent edges of __G__. in this paper we show that if __G__ is a graph with vertex __v__ then there is a tree __T__ with vertex __w__ such that \documentclass{ar