๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Subdivision Extendibility

โœ Scribed by Ronald Gould; Thor Whalen

Publisher
Springer Japan
Year
2007
Tongue
English
Weight
155 KB
Volume
23
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Extendibility of Rational Matrices
Extendibility of Rational Matrices
โœ Ding-Xuan Zhou ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 229 KB

A Characterization of extendibility of rational matrices is presented in terms of elementary properties. As a tool we give a solvability condition for a system of linear diophantine equations, which is of independent interest. Academic ## Press The property of extendibility of rational matrices

On extendibility of unavoidable sets
On extendibility of unavoidable sets
โœ Christian Choffrut; Karel Culik II ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 744 KB
On the extendibility of continuous funct
On the extendibility of continuous functions
โœ Horst Herrlich ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Elsevier Science โš– 339 KB

nearness preserving maps extension of (uniformly) continluou s maps J Every uniformly continuous function from a dense subspace of a unifom space into a complete uniform space has a u.ni:~ormly continuou,s extension. This well-known theorem ka:: no direct topological counterpart. The reason becomes

Two recursive theorems on n-extendibilit
Two recursive theorems on n-extendibility
โœ Tsuyoshi Nishimura; Akira Saito ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 255 KB

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