✦ LIBER ✦

On the maximum matchings of regular multigraphs

✍ Scribed by Takao Nishizeki

Book ID: 107748367
Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 793 KB
Volume: 37
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(81)90143-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Perfect Matchings of Near Regular

On the Perfect Matchings of Near Regular Graphs

✍ Xinmin Hou 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 112 KB

Lower bounds on the maximum genus of loo

Lower bounds on the maximum genus of loopless multigraphs

✍ Li Deming; Liu Yanpei 📂 Article 📅 2000 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 537 KB

Maximum matchings in a regular graph of

Maximum matchings in a regular graph of specified connectivity and bounded order

✍ P. Katerinis 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB

Tight Lower Bounds on the Size of a Maxi

Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph

✍ Michael A. Henning; Anders Yeo 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 106 KB

The number of maximum matchings in a tre

The number of maximum matchings in a tree

✍ Clemens Heuberger; Stephan Wagner 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 700 KB

The rainbow number of matchings in regul

The rainbow number of matchings in regular bipartite graphs

✍ Xueliang Li; Zhixia Xu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 386 KB

Given a graph G and a subgraph H of G, let rb(G, H) be the minimum number r for which any edge-coloring of G with r colors has a rainbow subgraph H. The number rb(G, H) is called the rainbow number of H with respect to G. Denote as mK 2 a matching of size m and as B n,k the set of all the k-regular