Upper bound for linear arboricity
✍
Paul C. Kainen
📂
Article
📅
1991
🏛
Elsevier Science
🌐
English
⚖ 264 KB
Using the K&&Hall Theorem, we establish the Akiyama-Exoo-Harary Conjecture up to an additive factor which is at most linear in the square root of the graph's topological genus.