✦ LIBER ✦

F-factors of graphs: A generalized matching problem

✍ Scribed by Jo¨rg Mu¨hlbacher

Book ID: 113162056
Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 872 KB
Volume: 8
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(79)90026-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximum (g,f)-factors of a general graph

✍ William Y.C. Chen 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 472 KB

Chen, W. Y. C., Maximum (g, f)-factors of a general graph, Discrete Mathematics 91 (1991) l-7. This paper presents a characterization of maximum (g, f)-factors of a general graph in which multiple edges and loops are allowed. An analogous characterization of the minimum (g,f)-factors of a general gr

A problem on generalized Cayley graphs o

A problem on generalized Cayley graphs of semigroups

✍ Wang, Shou-Feng 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 218 KB

Generalized -graphs for nonzero roots of

Generalized -graphs for nonzero roots of the matching polynomial

✍ Cheng Yeaw Ku; Kok Bin Wong 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 314 KB

Perfect matching for regular graphs is A

Perfect matching for regular graphs is AC0-hard for the general matching problem

✍ Elias Dahlhaus; Marek Karpinski 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 491 KB

Perfect Matchings of Generalized Polyomi

Perfect Matchings of Generalized Polyomino Graphs

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

On Generalizations of Matching-covered G

On Generalizations of Matching-covered Graphs

✍ Zoltán Szigeti 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 184 KB