𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Simplicial decompositions of graphs—Some uniqueness results

✍ Scribed by Reinhard Diestel

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
744 KB
Volume
42
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some results on tree decomposition of gr
Some results on tree decomposition of graphs
✍ Guoli Ding; Bogdan Oporowski 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 968 KB

## Abstract We investigate tree decompositions (__T__,(__X__~t~)~tϵV(T)~) whose width is “close to optimal” and such that all the subtrees of __T__ induced by the vertices of the graph are “small.” We prove the existence of such decompositions for various interpretations of “close to optimal” and “

Hamilton decompositions of some line gra
Hamilton decompositions of some line graphs
✍ David A. Pike 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 361 KB

## Abstract The main result of this paper completely settles Bermond's conjecture for bipartite graphs of odd degree by proving that if __G__ is a bipartite (2__k__ + 1)‐regular graph that is Hamilton decomposable, then the line graph, __L__(__G__), of __G__ is also Hamilton decomposable. A similar

A result on decompositions of regular gr
A result on decompositions of regular graphs
✍ Xiang-Ying Su 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 224 KB

A result on decompositions of regular graphs, Discrete Mathematics 105 (1992) 323-326. We prove that for any connected graph G and any integer r which is a common multiple of the degrees of the vertices in G, there exists a connected, r-regular, and G-decomposable graph H such that x(H) = x(G) and o