The computational complexity of the backbone coloring problem for planar graphs with connected backbones
Tytuł:
The computational complexity of the backbone coloring problem for planar graphs with connected backbones
Czasopismo:
Rok:
2015
Strony:
237-242
Tom (seria wydawnicza):
184
Numer DOI:
https://doi.org/10.1016/j.dam.2014.10.028
Link:
http://www.sciencedirect.com/science/article/pii/S0166218X14004739
Access:
ZAMKNIĘTY