𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On (g, f)-factorizations of graphs

✍ Scribed by Ma Runnian; Gao Hangshan


Publisher
Springer
Year
1997
Tongue
English
Weight
174 KB
Volume
18
Category
Article
ISSN
0253-4827

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Orthogonal (g,f)-factorizations in graph
✍ 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(

On Connected [g,f+1]-Factors in Graphs
✍ Guojun Li*†; Ying Xu†; Chuanping Chen; Zhenhong Liu πŸ“‚ Article πŸ“… 2005 πŸ› Springer-Verlag 🌐 English βš– 227 KB