𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Existence of subgraph with orthogonal (g,f)-factorization

✍ Scribed by Yan Guiying; Pan Jiaofeng

Publisher
SP Science China Press
Year
1998
Tongue
English
Weight
316 KB
Volume
41
Category
Article
ISSN
1674-7283

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Orthogonal (g, f)-factorizations in netw
Orthogonal (g, f)-factorizations in networks
✍ Peter Che Bor Lam; Guizhen Liu; Guojun Li; Wai Chee Shiu πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 96 KB πŸ‘ 1 views

Let G G G = (V V V, E E E) be a graph and let g g g and f f f be two integervalued functions defined on V V V such that k k k ≀ ≀ ≀ g g g(x x x) ≀ ≀ ≀ f f f(x x x) for all x x x ∈ ∈ ∈ V

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(