𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Orthogonal factorizations of graphs

✍ Scribed by Haodi Feng; Guizhen Liu

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
92 KB
Volume
40
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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 subgraph H with m edges. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 267–276, 2002

📜 SIMILAR VOLUMES

Cube factorizations of complete graphs
Cube factorizations of complete graphs
✍ Peter Adams; Darryn Bryant; Barbara Maenhaut 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB

## Abstract A cube factorization of the complete graph on __n__ vertices, __K~n~__, is a 3‐factorization of __K~n~__ in which the components of each factor are cubes. We show that there exists a cube factorization of __K~n~__ if and only if __n__ ≡ 16 (mod 24), thus providing a new family of unifor

1-Factorizations of random regular graph
1-Factorizations of random regular graphs
✍ M. S. O. Molloy; H. Robalewska; R. W. Robinson; N. C. Wormald 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB 👁 2 views

It is shown that for each r G 3, a random r-regular graph on 2 n vertices is equivalent in a certain sense to a set of r randomly chosen disjoint perfect matchings of the 2 n vertices, as n ª ϱ. This equivalence of two sequences of probabilistic spaces, called contiguity, occurs when all events almo

On isomorphic factorizations of circulan
On isomorphic factorizations of circulant graphs
✍ Brian Alspach; Danny Dyer; Donald L. Kreher 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

## Abstract We investigate the conjecture that every circulant graph __X__ admits a __k__‐isofactorization for every __k__ dividing |__E__(__X__)|. We obtain partial results with an emphasis on small values of __k__. © 2006 Wiley Periodicals, Inc. J Combin Designs 14: 406–414, 2006

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

On one-factorizations of compositions of
On one-factorizations of compositions of graphs
✍ P. Himelwright; W. D. Wallis; J. E. Williamson 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 223 KB 👁 1 views

## Abstract Let __G__[__H__] denote the composition of the graphs __G__ and __H.__ If __G__ can be decomposed into one‐factors and two‐factors, __H__ can be decomposed into one‐factors, and __H__ is not the empty graph on an odd number of vertices, then __G__[__H__] can be decomposed into one‐facto

On one-factorizations of compositions of
On one-factorizations of compositions of graphs
✍ P. Himelwright; W. D. Wailis; J. E. Williamson 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 53 KB

Lemma 2 of the paper asserts that if m is odd and s is odd then C,,,[R',J can be factorized into factors each of which is the point-disjoint union of one copy of C, with K s -1) copies of Cz,. We define certain cycles C,.,, , and our intention was that factor b (1 s b < s) would consist of all the c