BibTeX record journals/dam/AndersenF95

download as .bib file

@article{DBLP:journals/dam/AndersenF95,
  author       = {Lars D{\o}vling Andersen and
                  Herbert Fleischner},
  title        = {The NP-completeness of Finding A-trails in Eulerian Graphs and of
                  Finding Spanning Trees in Hypergraphs},
  journal      = {Discret. Appl. Math.},
  volume       = {59},
  number       = {3},
  pages        = {203--214},
  year         = {1995},
  url          = {https://doi.org/10.1016/0166-218X(95)80001-K},
  doi          = {10.1016/0166-218X(95)80001-K},
  timestamp    = {Thu, 11 Feb 2021 23:25:12 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/AndersenF95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.