## Abstract For any plane graph __G__ the number of edges in a minimum edge covering of the faces of __G__ is at most the vertex independence number of __G__ and the numbre of vertices in a minimum vertex covering of the faces of __G__ is at most the edge independence number of __G__. Β© 1995 John W
A Note on Connected Coverings of the Plane
β Scribed by Paul D. Humke
- Publisher
- John Wiley and Sons
- Year
- 1978
- Tongue
- English
- Weight
- 224 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract An __m__β__covering__ of a graph __G__ is a spanning subgraph of __G__ with maximum degree at most __m__. In this paper, we shall show that every 3βconnected graph on a surface with Euler genus __k__ββ₯β2 with sufficiently large representativity has a 2βconnected 7βcovering with at most
We discuss algebraic C-monomials of Deligne. Deligne used the theory of Hodge Cycles to show that algebraic C-monomials generate Kummer extensions of certain cyclotomic fields. Das, using a double complex of Anderson and Deligne's results, showed that certain powers of algebraic C-monomials and cert
## Abstract We give a 4βchromatic planar graph, which admits a vertex partition into three parts such that the union of every two of them induces a forest. This solves a problem posed by BΓΆhme. Also, by constructing an infinite sequence of graphs, we show that the cover degeneracy can be arbitraril