𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Indecomposable graphs

✍ Scribed by Pierre Ille


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
409 KB
Volume
173
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Minimal indecomposable graphs
✍ Alain Cournier; Pierre Ille πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 1011 KB
Indecomposable regular graphs and hyperg
✍ ZoltΓ‘n FΓΌredi πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 390 KB

Ftiredi, Z&an, Indecomposable regular graphs and hypergraphs, Discrete Mathematics 101 (1992) 59-64. Let G be a d-regular simple graph with n vertices. Here it is proved that for d > 6 -1, G contains a proper regular spanning subhypergraph. The same statement is proved for multigraphs with d > (n -1

Local indecomposability of certain geome
✍ J.I. Hall πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 912 KB

A graph is indecomposable if its complement is connected. If a graph is locally indecomposable, then it is typically indecomposable itself. Here we study the converse. Under what circumstances does global indecomposability force local indecomposability? The results are applied to a certain class of