The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones

Tytuł:
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones
Czasopismo:
Rok:
2015

Strony:
232-236

Tom (seria wydawnicza):
115(2)

Numer DOI:
https://doi.org/10.1016/j.ipl.2014.09.018

Access:
ZAMKNIĘTY