Estimation of cut-vertices in edge-coloured complete graphs
Discussiones Mathematicae Graph Theory (2005)
- Volume: 25, Issue: 1-2, page 217-218
- ISSN: 2083-5892
Access Full Article
top
How to cite
topAdam Idzik. "Estimation of cut-vertices in edge-coloured complete graphs." Discussiones Mathematicae Graph Theory 25.1-2 (2005): 217-218. <http://eudml.org/doc/270495>.
@article{AdamIdzik2005,
author = {Adam Idzik},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {cut-vertex; -edge-coloring},
language = {eng},
number = {1-2},
pages = {217-218},
title = {Estimation of cut-vertices in edge-coloured complete graphs},
url = {http://eudml.org/doc/270495},
volume = {25},
year = {2005},
}
TY - JOUR
AU - Adam Idzik
TI - Estimation of cut-vertices in edge-coloured complete graphs
JO - Discussiones Mathematicae Graph Theory
PY - 2005
VL - 25
IS - 1-2
SP - 217
EP - 218
LA - eng
KW - cut-vertex; -edge-coloring
UR - http://eudml.org/doc/270495
ER -
References
top- [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. Zbl0159.54203
- [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. Zbl0978.05031
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.