Estimation of cut-vertices in edge-coloured complete graphs
Discussiones Mathematicae. Graph Theory, Tome 25 (2005) no. 1-2, pp. 217-218
Cet article a éte moissonné depuis la source Library of Science
@article{DMGT_2005_25_1-2_a20,
author = {Idzik, Adam},
title = {Estimation of cut-vertices in edge-coloured complete graphs},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {217--218},
year = {2005},
volume = {25},
number = {1-2},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2005_25_1-2_a20/}
}
Idzik, Adam. Estimation of cut-vertices in edge-coloured complete graphs. Discussiones Mathematicae. Graph Theory, Tome 25 (2005) no. 1-2, pp. 217-218. http://geodesic.mathdoc.fr/item/DMGT_2005_25_1-2_a20/
[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.
[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.