The complexity of the T-coloring problem for graphs with small degree - Publication - Bridge of Knowledge

The complexity of the T-coloring problem for graphs with small degree

Abstract

Citations

4

CrossRef
0

Web of Science
0

Scopus

Authors (3)

Krzysztof Giaro prof. dr hab. inż.
Robert Janczewski
Michał Małafiejski

Cite as

Full text

full text is not available in portal

full content of the article see on external site open in new tab

Details

Category:: Magazine publication
Type:: Magazine publication
Published in:: DISCRETE APPLIED MATHEMATICS no. 129, edition 2-3, pages 361 - 369,
ISSN: 0166-218X
ISSN:: 0166-218X
Publication year:: 2003
DOI:: Digital Object Identifier (open in new tab) 10.1016/s0166-218x(02)00576-0
Verified by:: No verification

seen 66 times