We give two recursive theorems on n-extendible graphs. A graph G is said to be (k,n)extendible if every connected induced subgraph of G of order 2k is n-extendible. It is said to be [k, hi-extendible if G -V(H) is n-extendible for every connected induced subgraph H of G of order 2k. In this note we
A new recursive theorem onn-extendibility
β Scribed by Tsuyoshi Nishimura
- Publisher
- Springer Japan
- Year
- 1997
- Tongue
- English
- Weight
- 267 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Two theorems of A. Kotzig are extended, as follows: (1) A. Kotzig proved in 1963 that every 5-valent Sconnected planar graph contains a vertex which meets at least four triangles. We prove that if a 5-valent 3-connected graph on the orientable surface of genus g has pk k-gons, k 33, and mi vertices
## Abstract We consider the following generalization of the notion of a structure recursive relative to a set __X.__ A relational structure __A__ is said to be a Ξ(__X__)βstructure if for each relation symbol __R__, the interpretation of __R__ in __A__ is β relative to __X__, where Ξ² = Ξ(__R__). We