✦ LIBER ✦

On the smallest sets blocking simple perfect matchings in a convex geometric graph

✍ Scribed by Chaya Keller; Micha A. Perles

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Characterization of Co-blockers for Simp

✍ Chaya Keller, Micha A. Perles 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 344 KB

On the Number of Perfect Matchings in a

✍ de Carvalho, Marcelo H.; Lucchesi, Cláudio L.; Murty, U. S. R. 📂 Article 📅 2013 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 471 KB

On the Smallest Disconnecting Set in a G

✍ Boesch, F.; Frisch, I. 📂 Article 📅 1968 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 382 KB

A Distributive Lattice on the Set of Per

✍ Peter Che Bor Lam; Heping Zhang 📂 Article 📅 2003 🏛 Springer Netherlands 🌐 English ⚖ 176 KB

A superlinear bound on the number of per

✍ Louis Esperet; František Kardoš; Daniel Král’ 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 482 KB