@article{Syso1981, 
     author = "Sys{\l}o, Maciej M.", 
     doi = "10.1137/0210062", 
     issn = "0097-5397", 
     journal = "SIAM Journal on Computing", 
     keyword = "1,a graph g,a simple graph g,all-cycle algorithm,an edge is denoted,and edges e,and m,by e uv,cycle basis,cycle graph,cycle space method,denote the number of,e,g,introduction,is a collection of,let n,number of edges of,planar graph,resp,simple graphs do,v,vertices,vertices and the", 
     link = "http://epubs.siam.org/doi/abs/10.1137/0210062", 
     month = "nov", 
     number = "4", 
     pages = "797--808", 
     title = "An Efficient Cycle Vector Space Algorithm for Listing All Cycles of a Planar Graph", 
     uri = "http://epubs.siam.org/doi/abs/10.1137/0210062", 
     volume = "10", 
     year = "1981", 
}

Problems: 8