𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


A note on the cover degeneracy of graphs
✍ Li Zhang; Baoyindureng Wu πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 64 KB πŸ‘ 1 views

## 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

A note on shortest cycle covers of cubic
✍ Xinmin Hou; Cun-Quan Zhang πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 92 KB πŸ‘ 1 views

## 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_

A note on conservative graphs
✍ Arthur T. White πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 115 KB

## Abstract An application of conservative graphs to topological graph theory is indicated.

A note on coset graphs
✍ Ulrike Baumann πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 90 KB

## 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

A note on graphs spanned by Eulerian gra
✍ W. R. Pulleyblank πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 109 KB πŸ‘ 1 views

## 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