✦ LIBER ✦

Enumeration of Matchings in the Incidence Graphs of Complete and Complete Bipartite Graphs

✍ Scribed by Pippenger, Nicholas

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximum matching of given weight in comp

✍ A. V. Karzanov 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 641 KB

Packing bipartite graphs with covers of

✍ Chalopin, Jérémie; Paulusma, Daniël 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 385 KB

Total edge irregularity strength of comp

✍ Stanislav Jendrol’; Jozef Miškuf; Roman Soták 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 475 KB

Pagenumber of complete bipartite graphs

✍ Douglas J. Muder; Margaret Lefevre Weaver; Douglas B. West 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 929 KB

-factorization of complete bipartite gra

✍ Jian Wang; Beiliang Du 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 159 KB

Enumerating the orientable 2-cell imbedd

✍ Mull, Bruce P. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB 👁 2 views

A formula is developed for the number of congruence classes of 2cell imbeddings of complete bipartite graphs in closed orientable surfaces.