@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1274,
author = {Adam Idzik},
title = {Estimation of cut-vertices in edge-coloured complete graphs},
journal = {Discussiones Mathematicae Graph Theory},
volume = {25},
year = {2005},
pages = {217-218},
zbl = {1075.05037},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1274}
}
Adam Idzik. Estimation of cut-vertices in edge-coloured complete graphs. Discussiones Mathematicae Graph Theory, Tome 25 (2005) pp. 217-218. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1274/
[000] [1] J. Bosák, A. Rosa and S. Znám, On decompositions of complete graphs into factors with given diameters, in: P. Erdős and G. Katona, eds., Theory of Graphs, Proceedings of the Colloquium Held at Tihany, Hungary (Academic Press, New York, 1968) 37-56. | Zbl 0159.54203
[001] [2] A. Idzik and Z. Tuza, Heredity properties of connectedness in edge-coloured complete graphs, Discrete Math. 235 (2001) 301-306, doi: 10.1016/S0012-365X(00)00282-X. | Zbl 0978.05031