𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cycles in Graphs and Covers

✍ Scribed by Dreher, Deanna

Book ID
118197947
Publisher
Society for Industrial and Applied Mathematics
Year
2012
Tongue
English
Weight
426 KB
Volume
26
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Closure, 2-factors, and cycle coverings
Closure, 2-factors, and cycle coverings in claw-free graphs
✍ RyjοΏ½?ek, Zden?k; Saito, Akira; Schelp, R. H. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 239 KB πŸ‘ 3 views

In this article, we study cycle coverings and 2-factors of a claw-free graph and those of its closure, which has been defined by the first author (On a closure concept in claw-free graphs, J Combin Theory Ser B 70 (1997), 217-224). For a claw-free graph G and its closure cl(G), we prove: ( 1 (2) G

Covering Graphs by Cycles
Covering Graphs by Cycles
✍ Fan, Genghua πŸ“‚ Article πŸ“… 1992 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 687 KB
Covers and strong covers in directed bip
Covers and strong covers in directed bipartite graphs
✍ K. Vidyasankar πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 355 KB

## Abstract Let __G__ be a finite graph with directed bipartition (__V__^+^, __V__^βˆ’^). Necessary and sufficient conditions are given for the existence of covers and strong covers that: (i) satisfy matching with respect to __V__^+^, and (ii) include a given set of edges that satisfies matching with