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 2 of 12 found articles
 
 
  A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph
 
 
Title: A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph
Author: Ihm, Insung
Park, Jung-Heum
Appeared in: Discrete applied mathematics
Paging: Volume 218 (2017) nr. C pages 15 p.
Year: 2017
Contents:
Publisher: Elsevier B.V.
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

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