✦ LIBER ✦

Orthogonal one-factorization graphs

✍ Scribed by Jeffrey H. Dinitz

Publisher: John Wiley and Sons
Year: 1985
Tongue: English
Weight: 516 KB
Volume: 9
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190090112

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Orthogonal factorizations of graphs

✍ Haodi Feng; Guizhen Liu 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB

## Abstract Let __G__ be a graph with vertex set __V__(__G__) and edge set __E__(__G__). Let __k__~1~, __k__~2~,…,__k__~m~ be positive integers. It is proved in this study that every [0,__k__~1~+…+__k__~__m__~−__m__+1]‐graph __G__ has a [0, __k__~i~]~1~^__m__^‐factorization orthogonal to any given

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(

Almost-regular factorization of graphs

✍ Jin Akiyama; Mikio Kano 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 238 KB

For integers a and b, 0 s a s b, an [a,bl-graph G satisfies a s deg(x,G) s b for every vertex x of G, and an [a.bl-factor is a spanning subgraph its edges can be decomposed into [a,bl-factors. When both k and tare positive integers and s is a nonnegative integer, w e prove that every [(12k + 2)t +

Orthogonal latin square graphs

✍ Charles C. Lindner; E. Mendelsohn; N. S. Mendelsohn; Barry Wolk 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 617 KB

## Abstract An orthogonal latin square graph (OLSG) is one in which the vertices are latin squares of the same order and on the same symbols, and two vertices are adjacent if and only if the latin squares are orthogonal. If __G__ is an arbitrary finite graph, we say that __G__ is realizable as an O

On the factorization of graphs with exac

On the factorization of graphs with exactly one vertex of infinite degree

✍ François Bry 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 355 KB

We give a necessary and suflicient exactly one vertex of infinite degree. condition for the existence of a l-factor in graphs with ## 1. Illmmdon The following well-known necessary and sufficient condition for the existence of a l-factor in locally

P3-Factorization of complete bipartite g

P3-Factorization of complete bipartite graphs

✍ Kazuhiko Ushio 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 344 KB

P,-factorization of K,,,, is (i) m + n -0 (mod 3), (ii) m < 2n, (iii) n s 2m and (iv) 3mn/2(m + n) is an integer.