✦ LIBER ✦

Isomorphic factorizations of trees

✍ Scribed by Katherine Heinrich; Peter Horak

Publisher: John Wiley and Sons
Year: 1995
Tongue: English
Weight: 542 KB
Volume: 19
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190190206

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

A tree is even if its edges can be colored in two colors so that the monochromatic subgraphs are isomorphic. All even trees of maximum degree 3 in which no two vertices of degrees 1 or 3 are adjacent are determined. It is also shown that, for every n, there are only finitely many trees of maximum degree 3 and with n vertices of degree 3 that are not even. © 1995 John Wiley & Sons, Inc.

📜 SIMILAR VOLUMES

Isomorphic factorizations X: Unsolved pr

Isomorphic factorizations X: Unsolved problems

✍ Frank Harary; Robert W. Robinson 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 925 KB

An isomorphic factorization of a graph is a decomposition into isomorphic edgedisjoint subgraphs. A number of new and old open problems on isomorphic factorizations are presented along with some existing related results.

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

Isomorphic factorizations VII. Regular g

Isomorphic factorizations VII. Regular graphs and tournaments

✍ N. C. Wormald 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 272 KB

The divisibility theorem for isomorphic

The divisibility theorem for isomorphic factorizations of complete graphs

✍ Frank Harary; Robert W. Robinson; Nicholas C. Wormald 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 91 KB

Conditions ensuring starter induced 1-fa

Conditions ensuring starter induced 1-factorizations are not isomorphic

✍ E. Ihrig 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB

## Abstract In general, it is difficult to determine whether two starter induced 1‐factorizations of __K__~2__n__~ are isomorphic. However, when one of the 1‐factorizations has a unique starter group to within conjugacy, we show that two starter induced 1‐factorizations on __K__~2__n__~ are isomorp

A note on tree isomorphisms

✍ A.R Bednarek 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 139 KB