𝔖 Bobbio Scriptorium
✦   LIBER   ✦

(g,f)–Factorizations Randomly Orthogonal to a Subgraph in Graphs

✍ Scribed by Hao Zhao; Gui Zhen Liu; Xiao Xia Yan

Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2005
Tongue
English
Weight
169 KB
Volume
21
Category
Article
ISSN
1439-7617

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Orthogonal (g,f)-factorizations in graph
Orthogonal (g,f)-factorizations in graphs
✍ Guizhen Liu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 362 KB

LetGbeagraphandletF={F,,F,,..., F,,,} and H be a factorization and a subgraph of G, respectively. If H has exactly one edge in common with Fi for all i, 1 < i < m, then we say that F is orthogonal to H. Let g andf be two integer-valued functions defined on V(G) such that g(x) < f(x) for every x E V(