𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Generalization of Orthogonal Factorizations in Graphs

✍ Scribed by Guo Jun Li; Gui Zhen Liu

Book ID
106280079
Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2001
Tongue
English
Weight
154 KB
Volume
17
Category
Article
ISSN
1439-7617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Orthogonal factorizations of graphs
Orthogonal factorizations of graphs
✍ Haodi Feng; Guizhen Liu πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 92 KB

## Abstract Let __G__ be a graph with vertex set __V__(__G__) and edge set __E__(__G__). Let __k__~1~, __k__~2~,…,__k__~m~ be positive integers. It is proved in this study that every [0,__k__~1~+…+__k__~__m__~βˆ’__m__+1]‐graph __G__ has a [0, __k__~i~]~1~^__m__^‐factorization orthogonal to any given

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(