Simply Connected Compact Subsets of the Plane
β Scribed by T.I. Ramsamujh
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 118 KB
- Volume
- 237
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper rooted (near-) 4-regular maps on the plane are counted with respect to the root-valency, the number of edges, the number of inner faces, the number of non-root vertex loops, the number of non-root vertex blocks, and the number of multi-edges. As special cases, formulae of several types
Splitting off a pair su sv of edges in a graph G means the operation that deletes su and sv and adds a new edge uv. Given a graph G = V + s E which is kedge-connected (k β₯ 2) between vertices of V and a specified subset R β V , first we consider the problem of finding a longest possible sequence of
## Abstract The cyclic chromatic number of a plane graph __G__ is the smallest number Ο~__c__~(__G__) of colors that can be assigned to vertices of __G__ in such a way that whenever two distinct vertices are incident with a common face, they receive distinct colors. It was conjectured by Plummer an
A novel compact shorted patch antenna suitable to be mounted above the system ground plane of a wireless communication device is presented. With the proposed design, the antenna does not directly occupy the system ground plane, thus leaving the board space of the system ground plane or circuit board
A matrix Wiener-Hopf equation connected with a new canonical di raction problem is solved explicitly. We consider the di raction of a plane electromagnetic wave by an impedance loaded parallel plate waveguide formed by a two-part impedance plane and a parallel perfectly conducting half-plane. The re