@article{ Babic1993,
  abstract = {Acyclic walk of a graph is the closed walk whose projection is an acyclic graph. It is shown that the set of acyclic walks of the given graph G coincides with the set of closed walks of all spanning trees of G. Thus, an enumeration of acyclic walks can be performed by enumeration of closed walks of spanning trees and their subgraphs. By using the inclusion—exclusion principle another formula for the number of acyclic walks is derived, in terms of numbers of closed walks of connected subgraphs S of G and in terms of neighbors in S of vertices in G—S.},
  author = {Babí{c}, Darko and Graovac, Ante},
  doi = {10.1016/0166-218X(93)90055-S},
  file = {:Users/KunihiroWASA/Dropbox/paper/1993/Babí{c}, Graovac, Enumeration of acyclic walks in a graph, 1993.pdf:pdf},
  issn = {0166218X},
  journal = {Discrete Applied Mathematics},
  month = {August},
  number = {2},
  pages = {117--123},
  title = {{Enumeration of acyclic walks in a graph}},
  url = {http://www.sciencedirect.com/science/article/pii/0166218X9390055S},
  volume = {45},
  year = {1993}
}

{"_id":"ZZzreMojKsGCxqDPE","authorIDs":[],"author_short":["Babíc, D.","Graovac, A."],"bibbaseid":"babic-graovac-enumerationofacyclicwalksinagraph-1993","bibdata":{"abstract":"Acyclic walk of a graph is the closed walk whose projection is an acyclic graph. It is shown that the set of acyclic walks of the given graph G coincides with the set of closed walks of all spanning trees of G. Thus, an enumeration of acyclic walks can be performed by enumeration of closed walks of spanning trees and their subgraphs. By using the inclusion—exclusion principle another formula for the number of acyclic walks is derived, in terms of numbers of closed walks of connected subgraphs S of G and in terms of neighbors in S of vertices in G—S.","author":["Babíc, Darko","Graovac, Ante"],"author_short":["Babíc, D.","Graovac, A."],"bibtex":"@article{ Babic1993,\n abstract = {Acyclic walk of a graph is the closed walk whose projection is an acyclic graph. It is shown that the set of acyclic walks of the given graph G coincides with the set of closed walks of all spanning trees of G. Thus, an enumeration of acyclic walks can be performed by enumeration of closed walks of spanning trees and their subgraphs. By using the inclusion—exclusion principle another formula for the number of acyclic walks is derived, in terms of numbers of closed walks of connected subgraphs S of G and in terms of neighbors in S of vertices in G—S.},\n author = {Babí{c}, Darko and Graovac, Ante},\n doi = {10.1016/0166-218X(93)90055-S},\n file = {:Users/KunihiroWASA/Dropbox/paper/1993/Babí{c}, Graovac, Enumeration of acyclic walks in a graph, 1993.pdf:pdf},\n issn = {0166218X},\n journal = {Discrete Applied Mathematics},\n month = {August},\n number = {2},\n pages = {117--123},\n title = {{Enumeration of acyclic walks in a graph}},\n url = {http://www.sciencedirect.com/science/article/pii/0166218X9390055S},\n volume = {45},\n year = {1993}\n}","bibtype":"article","doi":"10.1016/0166-218X(93)90055-S","file":":Users/KunihiroWASA/Dropbox/paper/1993/Babíc, Graovac, Enumeration of acyclic walks in a graph, 1993.pdf:pdf","id":"Babic1993","issn":"0166218X","journal":"Discrete Applied Mathematics","key":"Babic1993","month":"August","number":"2","pages":"117--123","title":"Enumeration of acyclic walks in a graph","type":"article","url":"http://www.sciencedirect.com/science/article/pii/0166218X9390055S","volume":"45","year":"1993","bibbaseid":"babic-graovac-enumerationofacyclicwalksinagraph-1993","role":"author","urls":{"Paper":"http://www.sciencedirect.com/science/article/pii/0166218X9390055S"},"downloads":0,"html":""},"bibtype":"article","biburl":"http://www-ikn.ist.hokudai.ac.jp/~wasa/enum.bib","creationDate":"2015-04-23T04:51:44.869Z","downloads":0,"keywords":[],"search_terms":["enumeration","acyclic","walks","graph","babíc","graovac"],"title":"Enumeration of acyclic walks in a graph","year":1993,"dataSources":["YRMeqhMHoNu9HzJoC"]}