An exact algorithm for the generalized list T-coloring problem

Konstanty Junosza-Szaniawski, Pawel Rzazewski

Open source

DOI
10.46298/dmtcs.2095
Published
2014-06-19
Container
Discrete Mathematics & Theoretical Computer Science
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.46298/dmtcs.2095,
  title = {An exact algorithm for the generalized list T-coloring problem},
  author = {Konstanty Junosza-Szaniawski and Pawel Rzazewski},
  year = {2014},
  journal = {Discrete Mathematics \& Theoretical Computer Science},
  doi = {10.46298/dmtcs.2095},
  url = {https://doi.org/10.46298/dmtcs.2095}
}

RIS

TY  - JOUR
TI  - An exact algorithm for the generalized list T-coloring problem
AU  - Konstanty Junosza-Szaniawski
AU  - Pawel Rzazewski
PY  - 2014
JO  - Discrete Mathematics & Theoretical Computer Science
DO  - 10.46298/dmtcs.2095
UR  - https://doi.org/10.46298/dmtcs.2095
ER  - 

APA

Junosza-Szaniawski, K., & Rzazewski, P. (2014). An exact algorithm for the generalized list T-coloring problem. Discrete Mathematics & Theoretical Computer Science. https://doi.org/10.46298/dmtcs.2095

Source records