The NP-completeness of Finding A-trails in Eulerian Graphs and of Finding Spanning Trees in Hypergraphs

@article{Andersen1995TheNO,
  title={The NP-completeness of Finding A-trails in Eulerian Graphs and of Finding Spanning Trees in Hypergraphs},
  author={Lars D\ovling Andersen and Herbert Fleischner},
  journal={Discrete Applied Mathematics},
  year={1995},
  volume={59},
  pages={203-214}
}

From This Paper

Topics from this paper.

Similar Papers

Loading similar papers…