๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Graph cohomology and Kontsevich cycles

โœ Scribed by Kiyoshi Igusa


Book ID
108286147
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
501 KB
Volume
43
Category
Article
ISSN
0040-9383

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Fundamental cycles and graph embeddings
โœ Han Ren; HongTao Zhao; HaoLing Li ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› SP Science China Press ๐ŸŒ English โš– 223 KB
Partition of a graph into cycles and deg
โœ Hikoe Enomoto; Hao Li ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 177 KB

Let G be a graph of order n and k any positive integer with k 6 n. It has been shown by Brandt et al. that if |G| = n ยฟ 4k and if the degree sum of any pair of nonadjacent vertices is at least n, then G can be partitioned into k cycles. We prove that if the degree sum of any pair of nonadjacent vert