Complexité de l'arboricité linéaire d'un graphe
RAIRO-Oper. Res., 16 2 (1982) 125-129
Published online: 2017-02-06
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
On an f-coloring generalization of linear arboricity of multigraphs
Ronen WdowinskiDiscrete Mathematics 347 (2) 113777 (2024)
https://doi.org/10.1016/j.disc.2023.113777
The linear arboricity of K5-minor free graphs
Fan Yang, Jian-Liang Wu and Huimin SongDiscrete Applied Mathematics 322 49 (2022)
https://doi.org/10.1016/j.dam.2022.08.006
Linear Arboricity of Outer-1-Planar Graphs
Xin Zhang and Bi LiJournal of the Operations Research Society of China 9 (1) 181 (2021)
https://doi.org/10.1007/s40305-019-00243-2
12301 376 (2020)
https://doi.org/10.1007/978-3-030-60440-0_30
An efficient case for computing minimum linear arboricity with small maximum degree
Huijuan Wang, Lidong Wu, Miltiades P. Pardalos, Hongwei Du and Bin LiuOptimization Letters 13 (2) 419 (2019)
https://doi.org/10.1007/s11590-018-1278-2
Trees, Paths, Stars, Caterpillars and Spiders
Minghui JiangAlgorithmica 80 (6) 1964 (2018)
https://doi.org/10.1007/s00453-016-0237-5
On the Complexity of Deciding Whether the Regular Number is at Most Two
Ali Dehghan, Mohammad-Reza Sadeghi and Arash AhadiGraphs and Combinatorics 31 (5) 1359 (2015)
https://doi.org/10.1007/s00373-014-1446-9
Combinatorial Optimization and Applications
Minghui JiangLecture Notes in Computer Science, Combinatorial Optimization and Applications 9486 551 (2015)
https://doi.org/10.1007/978-3-319-26626-8_40
Minimum number of disjoint linear forests covering a planar graph
Huijuan Wang, Lidong Wu, Weili Wu and Jianliang WuJournal of Combinatorial Optimization 28 (1) 274 (2014)
https://doi.org/10.1007/s10878-013-9680-2
Recognizing d-Interval Graphs and d-Track Interval Graphs
Minghui JiangAlgorithmica 66 (3) 541 (2013)
https://doi.org/10.1007/s00453-012-9651-5
A Planar linear arboricity conjecture
Marek Cygan, Jian‐Feng Hou, Łukasz Kowalik, Borut Lužar and Jian‐Liang WuJournal of Graph Theory 69 (4) 403 (2012)
https://doi.org/10.1002/jgt.20592
Algorithms and Complexity
Marek Cygan, Łukasz Kowalik and Borut LužarLecture Notes in Computer Science, Algorithms and Complexity 6078 204 (2010)
https://doi.org/10.1007/978-3-642-13073-1_19
The Linear Arboricity of Graphs on Surfaces of Negative Euler Characteristic
Jian-Liang WuSIAM Journal on Discrete Mathematics 23 (1) 54 (2009)
https://doi.org/10.1137/S0895480101394690
The linear arboricity of planar graphs with no short cycles
Jian-Liang Wu, Jian-Feng Hou and Gui-Zhen LiuTheoretical Computer Science 381 (1-3) 230 (2007)
https://doi.org/10.1016/j.tcs.2007.05.003
Linear k-arboricities on trees
Gerard J. Chang, Bor-Liang Chen, Hung-Lin Fu and Kuo-Ching HuangDiscrete Applied Mathematics 103 (1-3) 281 (2000)
https://doi.org/10.1016/S0166-218X(99)00247-4
Complexité de l'arboricité linéaire d'un graphe II
B. PerocheRAIRO - Operations Research 19 (3) 293 (1985)
https://doi.org/10.1051/ro/1985190302931
On linear k-arboricity
J.C. Bermond, J.L. Fouquet, M. Habib and B. PerocheDiscrete Mathematics 52 (2-3) 123 (1984)
https://doi.org/10.1016/0012-365X(84)90075-X