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

W pracy ustalono złożoność obliczeniową problemu optymalnego kolorowania grafów o ustalonym stopniu.

Authors (3)

Cite as

Full text

download paper

downloaded 2 times

Publication version: Accepted or Published Version
License: Copyright (2003 Elsevier B.V)

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

Keywords

Details

Category:: Articles
Type:: artykuł w czasopiśmie z listy filadelfijskiej
Published in:: DISCRETE APPLIED MATHEMATICS pages 361 - 369,
ISSN: 0166-218X
Language:: English
Publication year:: 2003
Bibliographic description:: Giaro K., Janczewski R., Małafiejski M.: The complexity of the T-coloring problem for graphs with small degree. // DISCRETE APPLIED MATHEMATICS. -., nr. 129 (2003), s.361-369
Verified by:: Gdańsk University of Technology

seen 51 times