Hamilton circuits with many colours in properly edge-coloured complete graphs.
Andersen, Lars Dovling
Mathematica Scandinavica, Tome 64 (1989), p. 5-14 / Harvested from Göttinger Digitalisierungszentrum
Access to full text
Publié le : 1989-01-01
EUDML-ID : urn:eudml:doc:186120 
@article{PPN35397434X_0064+dmdlog4,
     title = {Hamilton circuits with many colours in properly edge-coloured complete graphs.},
     journal = {Mathematica Scandinavica},
     volume = {64},
     year = {1989},
     pages = {5-14},
     zbl = {0665.05028},
     url = {http://dml.mathdoc.fr/item/PPN35397434X_0064+dmdlog4}
}

Andersen, Lars Dovling. Hamilton circuits with many colours in properly edge-coloured complete graphs.. Mathematica Scandinavica, Tome 64 (1989) pp. 5-14. http://gdmltest.u-ga.fr/item/PPN35397434X_0064+dmdlog4/