𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improvement on vertex cover for low-degree graphs

✍ Scribed by Jianer Chen; Lihua Liu; Weijia Jia

Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
122 KB
Volume
35
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Note on vertex degrees of planar graphs
Note on vertex degrees of planar graphs
✍ Miroslaw TruszczyΓ‘ski πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 202 KB πŸ‘ 2 views
Minor-order obstructions for the graphs
Minor-order obstructions for the graphs of vertex cover 6
✍ Michael J. Dinneen; Liu Xiong πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 240 KB πŸ‘ 1 views

## Abstract We provide for the first time, a complete list of forbidden minors (obstructions) for the family of graphs with vertex cover 6. This study shows how to limit both the search space of graphs and improve the efficiency of an obstruction checking algorithm when restricted to __k__–VERTEX C

On low bound of degree sequences of span
On low bound of degree sequences of spanning trees inK-edge-connected graphs
✍ Zhenhong, Liu; Baoguang, Xu πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 257 KB πŸ‘ 3 views

[β€’] is a lower integer form and Ξ± depends on k. We show that every k-edge-connected graph with k β‰₯ 2, has a d k -tree, and Ξ± = 1 for k = 2, Ξ± = 2 for k β‰₯ 3.