Geodesic
Note on linear arboricity of graphs with large girth
Czechoslovak Mathematical Journal, Tome 41 (1991) no. 3, pp. 467-470
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CMJ.1991.102481
Classification : 05C35 
@article{10_21136_CMJ_1991_102481,
     author = {Guldan, Filip},
     title = {Note on linear arboricity of graphs with large girth},
     journal = {Czechoslovak Mathematical Journal},
     pages = {467--470},
     year = {1991},
     volume = {41},
     number = {3},
     doi = {10.21136/CMJ.1991.102481},
     mrnumber = {1117800},
     zbl = {0779.05026},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1991.102481/}
}
TY  - JOUR
AU  - Guldan, Filip
TI  - Note on linear arboricity of graphs with large girth
JO  - Czechoslovak Mathematical Journal
PY  - 1991
SP  - 467
EP  - 470
VL  - 41
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1991.102481/
DO  - 10.21136/CMJ.1991.102481
LA  - en
ID  - 10_21136_CMJ_1991_102481
ER  - 
%0 Journal Article
%A Guldan, Filip
%T Note on linear arboricity of graphs with large girth
%J Czechoslovak Mathematical Journal
%D 1991
%P 467-470
%V 41
%N 3
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1991.102481/
%R 10.21136/CMJ.1991.102481
%G en
%F 10_21136_CMJ_1991_102481
Guldan, Filip. Note on linear arboricity of graphs with large girth. Czechoslovak Mathematical Journal, Tome 41 (1991) no. 3, pp. 467-470. doi: 10.21136/CMJ.1991.102481

[1] J. Akiyama G. Exoo, F. Harary: Covering and packing in graphs III. Cyclic and acyclic invariants. Math. Slovaca 30, 1980, 405-417. | MR

[2] J. Akiyama C. Exoo, F. Harary: Covering and packing in graphs IV. Linear arboricity. Networks II, 1981, 69-72. | MR

[3] N. Alon: The linear arboricity of graphs. Israel J. of Math. 62, 1988, 311-325. | DOI | MR | Zbl

[4] H. Enomoto: The linear arboricity of 5-regular graphs. Tech. report, Dept. of Information Sci., Univ. of Tokyo, 1981.

[5] H. Enomoto, B. Péroche: The linear arboricity of some regular graphs. J. Graph Theory 8, 1984, 309-324. | DOI | MR

[6] P. Erdös, L. Lovász: Problems and results on 3-chromatic hypergraphs and some related questions. in "Infinite and Finite Sets" (A. Hajnal et. al. eds.), North Holland, Amsterdam, 1975, 609-628. | MR

[7] F. Guldan: The linear arboricity of 10-regular graphs. Math. Slovaca 36, 1986, 225 - 228. | MR

[8] F. Guldan: Some results on linear arboricity. J. Graph Theory 10, 1986, 505-509. | DOI | MR | Zbl

[9] F. Guldan: On a problem of linear arboricity. Časopis pro pěstování matematiky 112, 1987, 395-400. | MR | Zbl

[10] F. Harary: Covering and packing in graphs I. Ann. N. Y. Acad. Sci. 175, 1970, 198-205. | DOI | MR | Zbl

[11] J. Petersen: Die Theorie der regulären Graphs. Acta Math. 15, 1891, 193 - 220. | MR

[12] J. Spencer: Ten Lectures on the Probabilistic Method. SIAM, Philadelphia 1987, 61-62. | MR | Zbl

[13] P. Tomasta: Note on linear arboricity. Math. Slovaca 32, 1982, 239-242. | MR | Zbl

Cité par Sources :