𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on the minimum cut cover of graphs

✍ Scribed by Ho Tung-Yang; Hsu Lih-Hsing

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
105 KB
Volume
15
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A note on the cover degeneracy of graphs
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 coverings of plane graphs
A note on coverings of plane graphs
✍ Eduardo Rivera-Campo πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 175 KB πŸ‘ 1 views

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

On minimum sets of 1-factors covering a
On minimum sets of 1-factors covering a complete multipartite graph
✍ David Cariolaro; Hung-Lin Fu πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 132 KB πŸ‘ 1 views

## Abstract We determine necessary and sufficient conditions for a complete multipartite graph to admit a set of 1‐factors whose union is the whole graph and, when these conditions are satisfied, we determine the minimum size of such a set. Β© 2008 Wiley Periodicals, Inc. J Graph Theory 58:239‐250,