On the point linear arboricity of a graph
In a linear forest, every component is a path. The linear arboricity of a graph <em>G</em> is the smallest number of edge disjoint linear forests whose union is <em>G</em>; this concept has been much studied. We now introduce the point linear arboricity of <em>G</em&...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Università degli Studi di Catania
1989-10-01
|
| Series: | Le Matematiche |
| Online Access: | http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/686 |