Note on linear arboricity
Mathematica Slovaca (1982)
- Volume: 32, Issue: 3, page 239-242
- ISSN: 0139-9918
Access Full Article
topHow to cite
topTomasta, Pavel. "Note on linear arboricity." Mathematica Slovaca 32.3 (1982): 239-242. <http://eudml.org/doc/34132>.
@article{Tomasta1982,
author = {Tomasta, Pavel},
journal = {Mathematica Slovaca},
keywords = {covering; regular graphs; linear forest},
language = {eng},
number = {3},
pages = {239-242},
publisher = {Mathematical Institute of the Slovak Academy of Sciences},
title = {Note on linear arboricity},
url = {http://eudml.org/doc/34132},
volume = {32},
year = {1982},
}
TY - JOUR
AU - Tomasta, Pavel
TI - Note on linear arboricity
JO - Mathematica Slovaca
PY - 1982
PB - Mathematical Institute of the Slovak Academy of Sciences
VL - 32
IS - 3
SP - 239
EP - 242
LA - eng
KW - covering; regular graphs; linear forest
UR - http://eudml.org/doc/34132
ER -
References
top- AKLYAMA J., EXOO G., HARARY F., Coveriпg and packing in graphs III, Cyclic and acyclic invariants, Math. Slovaca 30, 1980. (1980)
- HARARY F., Covering and packing in graphs I., Ann. N.Y. Acad. Sci., 175, 1970, 198-205. (1970) Zbl0226.05119MR0263677
- HILTON A. J. W., Canonical edge-colourings of locally finite gгaphs, (submitted to J. Comb. Theory).
- STANTON R., COWAN D., JAMES L., Some results on path numbers, Proc. Louisiana Conf. Combinatorics, Graph Theory and Computing, (R.C. Read ed.) Academic Press, New York 1972, 285-294. (1972) MR0342434
Citations in EuDML Documents
top- Mirosław Truszczyński, Linear arboricity of graphs
- Filip Guldan, The linear arboricity of -regular graphs
- B. Peroche, Complexité de l'arboricité linéaire d'un graphe II
- Filip Guldan, On a problem of linear arboricity
- Martin Knor, Note on linear arboricity
- Filip Guldan, Note on linear arboricity of graphs with large girth
- Filip Guldan, Acyclic chromatic index and linear arboricity of graphs
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.