𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parity Subgraph, Shortest Cycle Cover, and Postman Tour

✍ Scribed by Zhang, Cun-Quan

Book ID
118198462
Publisher
Society for Industrial and Applied Mathematics
Year
1993
Tongue
English
Weight
455 KB
Volume
6
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Postman tours and cycle covers
Postman tours and cycle covers
✍ AndrΓ© Raspaud πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 509 KB

Raspaud, A., Postman tours and cycle covers, Discrete Mathematics 111 (1993) 447-454. Let G be a bridgeless graph. We show that the length of a shortest postman tour is at most IF(G)1 + 1 k'(G)1 -3 and that, if G is a minimally 2-edge connected graph, then the length is at most 21 V(G)l-2. We then

Smallest (1, 2)-eulerian weight and shor
Smallest (1, 2)-eulerian weight and shortest cycle covering
✍ Cheng Zhao πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 358 KB

## Abstract The concept of a (1, 2)‐eulerian weight was introduced and studied in several papers recently by Seymour, Alspach, Goddyn, and Zhang. In this paper, we proved that if __G__ is a 2‐connected simple graph of order __n (n__ ≧ 7) and __w__ is a smallest (1, 2)‐eulerian weight of graph __G__