𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On (g, f)-Uniform Graphs

✍ Scribed by Gui-zhen Liu; Yan Liu

Book ID
106301047
Publisher
Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2005
Tongue
English
Weight
172 KB
Volume
21
Category
Article
ISSN
0168-9673

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On (g, f)-factorizations of graphs
On (g, f)-factorizations of graphs
✍ Ma Runnian; Gao Hangshan πŸ“‚ Article πŸ“… 1997 πŸ› Springer 🌐 English βš– 174 KB
On betweenness-uniform graphs
On betweenness-uniform graphs
✍ Gago, Silvia; HurajovÑ, Jana CoroničovÑ; Madaras, TomÑő πŸ“‚ Article πŸ“… 2013 πŸ› Springer 🌐 English βš– 249 KB
On Connected [g,f+1]-Factors in Graphs
On Connected [g,f+1]-Factors in Graphs
✍ Guojun Li*†; Ying Xu†; Chuanping Chen; Zhenhong Liu πŸ“‚ Article πŸ“… 2005 πŸ› Springer-Verlag 🌐 English βš– 227 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(