Minimal indecomposable graphs
β Scribed by Alain Cournier; Pierre Ille
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 1011 KB
- Volume
- 183
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
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