✦ LIBER ✦

Solution of a research problem on trees of subsets

✍ Scribed by Wu Shiquan

Book ID: 112818128
Publisher: SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year: 1994
Tongue: English
Weight: 179 KB
Volume: 9
Category: Article
ISSN: 1005-1031
DOI: 10.1007/bf02662068

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A solution of Chartrand's problem on spa

A solution of Chartrand's problem on spanning trees

✍ Oai Maocheng 📂 Article 📅 1984 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 141 KB

Solution of a problem on non-negative su

Solution of a problem on non-negative subset sums

✍ Konrad Engel; Caterina Nardi 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 190 KB

Solution of a research problem

✍ Shiquan Wu 📂 Article 📅 1996 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 523 KB

Pansystems research on a type of fixed s

Pansystems research on a type of fixed subsets

✍ Li Gui-hua 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 303 KB

Solutions of a problem of Ore on spannin

Solutions of a problem of Ore on spanning trees and its generalization

✍ G.B. Mund; S.B. Rao; C.K. Mohapatra 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 232 KB

Solutions to Edmonds' and Katona's probl

Solutions to Edmonds' and Katona's problems on families of separating subsets

✍ Cai Mao-cheng 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 571 KB

## Let G be a finite loopless graph with vertex-set V(G) and edge-set E(G). JZdmonds' problem is to determine the smallest integer, denoted by g(G), for which there exists a family A,, . . . , AI(G) of subsets of V(G) such that for any adjacent xi, Xi E V(G) there are disjoint