✦ LIBER ✦

Graphs of Triangulations and Perfect Matchings

✍ Scribed by M.E. Houle; F. Hurtado; M. Noy; E. Rivera-Campo

Publisher: Springer Japan
Year: 2005
Tongue: English
Weight: 139 KB
Volume: 21
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-005-0615-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs with independent perfect matching

Graphs with independent perfect matchings

✍ Marcelo H. de Carvalho; Cláudio L. Lucchesi; U. S. R. Murty 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 241 KB

A graph with at least two vertices is matching covered if it is connected and each edge lies in some perfect matching. A matching covered graph G is extremal if the number of perfect matchings of G is equal to the dimension of the lattice spanned by the set of incidence

Random Lifts Of Graphs: Perfect Matching

Random Lifts Of Graphs: Perfect Matchings

✍ Nathan Linial*; Eyal Rozenman 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 265 KB

Graphs of Non-Crossing Perfect Matchings

✍ C. Hernando; F. Hurtado; Marc Noy 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 256 KB

Perfect Matchings of Generalized Polyomi

Perfect Matchings of Generalized Polyomino Graphs

✍ Chen Rong Si 📂 Article 📅 2005 🏛 Springer Japan 🌐 English ⚖ 157 KB

Perfect matchings in regular bipartite g

Perfect matchings in regular bipartite graphs

✍ P. Katerinis; N. Tsikopoulos 📂 Article 📅 1996 🏛 Springer Japan 🌐 English ⚖ 356 KB

Wing-triangulated graphs are perfect

✍ Hougardy, Stefan; Le, Van Bang; Wagler, Annegret 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB 👁 2 views

The wing-graph W (G) of a graph G has all edges of G as its vertices; two edges of G are adjacent in W (G) if they are the nonincident edges (called wings) of an induced path on four vertices in G. Hoàng conjectured that if W (G) has no induced cycle of odd length at least five, then G is perfect. A