✦ LIBER ✦

Matching signatures and Pfaffian graphs

✍ Scribed by Alberto Alexandre Assis Miranda; Cláudio Leonardo Lucchesi

Book ID: 108114277
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 239 KB
Volume: 311
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2010.10.014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matchings and pfaffians

✍ K.K. Nambiar 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 139 KB

Pfaffian of a skew symmetric matrix obtained from an undirected graph is used to enumerate the matchings in the graph.

Pfaffian graphs,T-joins and crossing num

Pfaffian graphs,T-joins and crossing numbers

✍ Serguei Norine 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 202 KB

Matching graphs

✍ Eroh, Linda; Schultz, Michelle 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 336 KB

The matching graph M (G) of a graph G is that graph whose vertices are the maximum matchings in G and where two vertices M 1 and M 2 of M (G) this graph models a metric space whose metric is defined on the set of maximum matchings in G. Which graphs are matching graphs of some graph is not known in

Matchings and matching extensions in gra

Matchings and matching extensions in graphs

✍ Ciping Chen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 360 KB

Let G be a graph with a perfect matching and k be an integer such that l~<k< I V(G)l/2. Then G is said to be k-extendable if every matching of size k in G extends to a perfect matching of G. Plummer (1994) proved that every (2k + 1)-connected K~,s-free graph of even order is k-extendable. In this p

Pfaffian orientations, 0–1 permanents, a

Pfaffian orientations, 0–1 permanents, and even cycles in directed graphs

✍ Vijay V. Vazirani; Milhalis Yannakakis 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 935 KB

Shock Graphs and Shape Matching

✍ Kaleem Siddiqi; Ali Shokoufandeh; Sven J. Dickinson; Steven W. Zucker 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 437 KB