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 3187 of 3648 found articles
 
 
  The computational complexity of the backbone coloring problem for planar graphs with connected backbones
 
 
Title: The computational complexity of the backbone coloring problem for planar graphs with connected backbones
Author: Janczewski, Robert
Turowski, Krzysztof
Appeared in: Discrete applied mathematics
Paging: Volume 184 (2015) nr. C pages 6 p.
Year: 2015
Contents:
Publisher: Elsevier B.V.
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

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