×

Some problems about linear arboricity. (English) Zbl 0486.05053


MSC:

05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C05 Trees
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Akiyama, J., Three developing topics in graph theory, (Doctoral Dissertation (1980), University of Tokyo)
[2] Akiyama, J.; Exoo, G.; Harary, F., Covering and packing in graphs, III: cyclic and acyclic invariants, Math. Slovaca, 30, 4, 405-417 (1980) · Zbl 0458.05050
[3] Akiyama, J.; Exoo, G.; Harary, F., Covering and packing in graphs, IV: linear arboricity, Networks, 11, 69-72 (1981) · Zbl 0479.05027
[4] J.-C. Bermond, J.L. Fouquet, M. Habib and B. Peroche, On \(k\); J.-C. Bermond, J.L. Fouquet, M. Habib and B. Peroche, On \(k\)
[5] Habib, M.; Peroche, B., \(La k\)-arboricité linéaire des arbres. présenté au colloque de Théorie des Graphes et Combinatoire (1981), Luminy · Zbl 0523.05025
[6] Harary, F., Coverings and packing in graphs I, Ann. N.Y. Acad. Sci., 175, 198-205 (1970) · Zbl 0226.05119
[7] Hell, P.; Rosa, A., Graph decompositions, handcuffed prisoners and balanced \(p\)-designs, Discrete Math., 2, 229-252 (1972) · Zbl 0251.05015
[8] Sotteau, D., Décompositions de graphes et d’hypergraphes, (Thèse Sci. Math. (1980), Université Paris-Sud)
[9] Vizing, D. Z., On an estimate of the chromatic class of a \(p\)-graph, Diskret Analiz., 3, 25-30 (1964)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.