On tours that contain all edges of a hypergraph.
Lonc, Zbigniew ; Naroski, Paweł
The Electronic Journal of Combinatorics [electronic only], Tome 17 (2010), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2010-01-01
EUDML-ID : urn:eudml:doc:230726 
@article{05827393,
     title = {On tours that contain all edges of a hypergraph.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {17},
     year = {2010},
     zbl = {1204.05064},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05827393}
}

Lonc, Zbigniew; Naroski, Paweł. On tours that contain all edges of a hypergraph.. The Electronic Journal of Combinatorics [electronic only], Tome 17 (2010) . http://gdmltest.u-ga.fr/item/05827393/