On edge colorings with at least q colors in every subset of p vertices.
Sárközy, Gábor N. ; Selkow, Stanley
The Electronic Journal of Combinatorics [electronic only], Tome 8 (2001), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2001-01-01
EUDML-ID : urn:eudml:doc:120919 
@article{01560716,
     title = {On edge colorings with at least },
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {8},
     year = {2001},
     zbl = {0960.05047},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01560716}
}

Sárközy, Gábor N.; Selkow, Stanley. On edge colorings with at least . The Electronic Journal of Combinatorics [electronic only], Tome 8 (2001) . http://gdmltest.u-ga.fr/item/01560716/