✦ LIBER ✦

Randomly Orthogonal (g,f)-factorizations in Graphs

✍ Scribed by Gui-zhen Liu; He-ping Long

Publisher: Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2002
Tongue: English
Weight: 125 KB
Volume: 18
Category: Article
ISSN: 0168-9673
DOI: 10.1007/s102550200050

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

(g,f)–Factorizations Randomly Orthogonal

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

✍ Hao Zhao; Gui Zhen Liu; Xiao Xia Yan 📂 Article 📅 2005 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 169 KB

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(

(g, f)-factorizations orthogonal to a su

(g, f)-factorizations orthogonal to a subgraph in graphs

✍ Guojun Li; Guizhen Liu 📂 Article 📅 1998 🏛 SP Science China Press 🌐 English ⚖ 333 KB

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

(g,f)-Factorizations of graphs orthogona

(g,f)-Factorizations of graphs orthogonal to [1,2]-subgraph

✍ Guiying Yan 📂 Article 📅 1997 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 315 KB

On (g, f)-factorizations of graphs

✍ Ma Runnian; Gao Hangshan 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 174 KB