𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper bound for linear arboricity

✍ Scribed by Paul C. Kainen

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
264 KB
Volume
4
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

Bounds for the vertex linear arboricity
Bounds for the vertex linear arboricity
✍ Makoto Matsumoto πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 351 KB

## Abstract The vertex __linear__ arboricity vla(__G__) of a nonempty graph __G__ is the minimum number of subsets into which the vertex set __V(G)__ can be partitioned so that each subset induces a subgraph whose connected components are paths. This paper provides an upper bound for vla(__G__) of

Linear arboricity for graphs with multip
Linear arboricity for graphs with multiple edges
✍ Houria AΓ―t-djafer πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 266 KB

Akiyama, Exoo, and Harary conjectured that for any simple graph G with maximum degree A(G). the linear arboricity / a ( G ) satisfies rA(G)/21 5 /a(G) 5 r(A(G) + 11/21, Here it is proved that if G is a loopless graph with maximum degree A ( G ) S k and maximum edge multiplicity ## 1. Introduction