✦ LIBER ✦

Decomposition of Graphs into (g, f)-Factors

✍ Scribed by G. Y. Yan; J. F. Pan; C. K. Wong; Taro Tokuda

Publisher: Springer Japan
Year: 2000
Tongue: English
Weight: 115 KB
Volume: 16
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s003730050009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decompositions of complete graphs into r

Decompositions of complete graphs into regular bichromatic factors

✍ Anton Kotzig 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 517 KB

The proof of the following theorem is given: A complete graph with n vertkes can he decomposed into r regular bichromatic factors if and only if n is even and greater thl;iirl 4 and there exists $1 natural number k with the properties that k < r anu. ak-l < n 5 Zk.

Decompositions of complete graphs into r

Decompositions of complete graphs into regular bichromatic factors

✍ Anton Kotzig 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 425 KB

Abstxact. The purpose of this paper is to find iI nccessar) and sufficient condition fltr the euis-trn~~ of ;L decoillposi!ion of a ~omplcte graph with given number of vc;tices into regular bichro-ma% ticfor ;uld v.1 artswcr thy' question what is the possible number of factors in such a de-c~?rnp~~i

On (g, f)-factorizations of graphs

✍ Ma Runnian; Gao Hangshan 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 174 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(

On Connected [g,f+1]-Factors in Graphs

✍ Guojun Li*†; Ying Xu†; Chuanping Chen; Zhenhong Liu 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 227 KB

A Characterization of Graphs Having All

A Characterization of Graphs Having All (g, f)-Factors

✍ Thomas Niessen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 310 KB

Let G be a graph with vertex set V and let g, f : V Ä Z + . We say that G has all ( g, f )-factors if G has an h-factor for every h: V Ä Z + such that g(v) h(v) f (v) for every v # V and at least one such h exists. In this note, we derive from Tutte's f-factor theorem a similar characterization for