A note on coverings of plane graphs
β Scribed by Eduardo Rivera-Campo
- Publisher
- John Wiley and Sons
- Year
- 1995
- Tongue
- English
- Weight
- 175 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
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 Wiley & Sons, Inc.
π SIMILAR VOLUMES
## 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
## Abstract Let __SCC__~3~(__G__) be the length of a shortest 3βcycle cover of a bridgeless cubic graph __G__. It is proved in this note that if __G__ contains no circuit of length 5 (an improvement of Jackson's (__JCTB 1994__) result: if __G__ has girth at least 7) and if all 5βcircuits of __G_
## Abstract An application of conservative graphs to topological graph theory is indicated.
## Abstract Coset graphs are a generalization of Cayley graphs. They arise in the construction of graphs and digraphs with transitive automorphism groups. Moreover, the consideration of coset graphs makes it possible to give an algebraic description of regular connected graphs of even degree. In th
## Abstract We show that the problem raised by Boesch, Suffel, and Tindell of determining whether or not a graph is spanned by an Eulerian subgraph is NPβcomplete. We also note that there does exist a good algorithm for determining if a graph is spanned by a subgraph having positive even degree at