For which graphs does every edge belong to exactly two chordless cycles?
Peled, Uri N. ; Wu, Julin
The Electronic Journal of Combinatorics [electronic only], Tome 3 (1996), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 1996-01-01
EUDML-ID : urn:eudml:doc:118909 
@article{00907635,
     title = {For which graphs does every edge belong to exactly two chordless cycles?},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {3},
     year = {1996},
     zbl = {0851.05072},
     language = {en},
     url = {http://dml.mathdoc.fr/item/00907635}
}

Peled, Uri N.; Wu, Julin. For which graphs does every edge belong to exactly two chordless cycles?. The Electronic Journal of Combinatorics [electronic only], Tome 3 (1996) . http://gdmltest.u-ga.fr/item/00907635/