Digital Library
Close Browse articles from a journal
 
<< previous    next >>
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
           All articles of the corresponding issues
                                       Details for article 785 of 849 found articles
 
 
  The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs
 
 
Title: The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs
Author: Døvling Andersen, Lars
Fleischner, Herbert
Appeared in: Discrete applied mathematics
Paging: Volume 59 (1995) nr. 3 pages 12 p.
Year: 1995
Contents:
Publisher: Published by Elsevier B.V.
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

                             Details for article 785 of 849 found articles
 
<< previous    next >>
 
 Koninklijke Bibliotheek - National Library of the Netherlands