1984
DOI: 10.1016/0012-365x(84)90075-x
|View full text |Cite
|
Sign up to set email alerts
|

On linear k-arboricity

Abstract: HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des labora… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
25
0

Year Published

1999
1999
2019
2019

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 51 publications
(25 citation statements)
references
References 8 publications
0
25
0
Order By: Relevance
“…For C ≥ 5 we can easily prove that M (C, 3) = 2, making use of a conjecture made by Bermond et al in 1984 [5] and proved by Thomassen in 1999 [19]: A linear k-forest is a forest consisting of paths of length at most k. The linear k-arboricity of a graph G is the minimum number of linear k-forests required to partition E(G), and is denoted by la k (G) [5]. Theorem 2 is equivalent to saying that, if G is cubic, then la 5 (G) = 2.…”
Section: Case C ≥mentioning
confidence: 99%
“…For C ≥ 5 we can easily prove that M (C, 3) = 2, making use of a conjecture made by Bermond et al in 1984 [5] and proved by Thomassen in 1999 [19]: A linear k-forest is a forest consisting of paths of length at most k. The linear k-arboricity of a graph G is the minimum number of linear k-forests required to partition E(G), and is denoted by la k (G) [5]. Theorem 2 is equivalent to saying that, if G is cubic, then la 5 (G) = 2.…”
Section: Case C ≥mentioning
confidence: 99%
“…In fact, solving a conjecture of Bermond et al [20], Thomassen proved [21] a stronger result: the edges of any cubic graph can be two-colored such that each monochromatic connected component is a path of length at most 5 (see Fig. 2(a) for an example).…”
Section: Hardness Results For General Graphsmentioning
confidence: 99%
“…Chang [3] and Chang et al [4] investigated the algorithmic aspects of the linear k-arboricity. It was further studied by Bermond et al [2], Jackson and Wormald [8], and Aldred and Wormald [1]. Lih, Tong and Wang [9] proved that for a planar graph G, la 2 …”
Section: If Uv ∈ E(g) Then U Is Said To Be the Neighbor Of V And N mentioning
confidence: 99%
“…It was further studied by Bermond et al [2], Jackson and Wormald [8], and Aldred and Wormald [1]. Lih, Tong and Wang [9] proved that for a planar graph G, la 2 …”
Section: If Uv ∈ E(g) Then U Is Said To Be the Neighbor Of V And N mentioning
confidence: 99%
See 1 more Smart Citation