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 |
| id |
doaj-a603f7d310844b8eb114c11254371d7f |
|---|---|
| record_format |
Article |
| spelling |
doaj-a603f7d310844b8eb114c11254371d7f2020-11-25T03:45:00ZengUniversità degli Studi di CataniaLe Matematiche0373-35052037-52981989-10-01442281286652On the point linear arboricity of a graphFrank HararyRandall MaddoxWilliam StatonIn 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>, defined as the smallest number of parts in a partition of <em>V=V(G)</em> such that each part induces a linear forest. We prove an analogue to the classical theorem of Brooks for the invariant.http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/686 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Frank Harary Randall Maddox William Staton |
| spellingShingle |
Frank Harary Randall Maddox William Staton On the point linear arboricity of a graph Le Matematiche |
| author_facet |
Frank Harary Randall Maddox William Staton |
| author_sort |
Frank Harary |
| title |
On the point linear arboricity of a graph |
| title_short |
On the point linear arboricity of a graph |
| title_full |
On the point linear arboricity of a graph |
| title_fullStr |
On the point linear arboricity of a graph |
| title_full_unstemmed |
On the point linear arboricity of a graph |
| title_sort |
on the point linear arboricity of a graph |
| publisher |
Università degli Studi di Catania |
| series |
Le Matematiche |
| issn |
0373-3505 2037-5298 |
| publishDate |
1989-10-01 |
| description |
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>, defined as the smallest number of parts in a partition of <em>V=V(G)</em> such that each part induces a linear forest. We prove an analogue to the classical theorem of Brooks for the invariant. |
| url |
http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/686 |
| work_keys_str_mv |
AT frankharary onthepointlineararboricityofagraph AT randallmaddox onthepointlineararboricityofagraph AT williamstaton onthepointlineararboricityofagraph |
| _version_ |
1724512047717154816 |