✦ LIBER ✦

Decomposition of graphs

✍ Scribed by R. I. Tyshkevich; A. A. Chernyak

Publisher: Springer US
Year: 1985
Tongue: English
Weight: 794 KB
Volume: 21
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01072106

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tree decomposition of graphs

✍ Raphael Yuster 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB 👁 1 views

with ␦ G G V r2 q 10 h V log V , and h y 1 divides E , then there is a decomposition of the edges of G into copies of H. This result is asymptotically the best possible for all trees with at least three vertices.

Atoll decompositions of graphs

✍ Fred Buckley 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 352 KB

## Abstract An island decomposition of a graph __G__ consists of a set of vertex‐disjoint paths which cover the vertex set of __G.__ If the endpoints of the paths are mutually nonadjacent, then we have an atoll decomposition. We characterize graphs requiring two paths in an island decomposition yet

Automorphic Decompositions of Graphs

✍ Robert A. Beeler; Robert E. Jamison 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 196 KB

Petersen Graph Decompositions of Complet

Petersen Graph Decompositions of Complete Multipartite Graphs

✍ Jinhua Wang; Dengju Ma 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 163 KB

Perfect graph decompositions

✍ Zsolt Tuza 📂 Article 📅 1991 🏛 Springer Japan 🌐 English ⚖ 291 KB

Decomposition of Graphs on Surfaces

✍ Maurits de Graaf; Alexander Schrijver 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 266 KB

dedicated to professor w. t. tutte on the occasion of his eightieth birthday Let G=(V, E) be an Eulerian graph embedded on a triangulizable surface S. We show that E can be decomposed into closed curves C 1 , ..., C k such that mincr(G, D)= k i=1 mincr(C i , D) for each closed curve D on S. Here min