On the computational complexity of the forcing chromatic number

Wolfgang Slany, Frank Harary, Oleg Verbitsky

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

Original language	English
Title of host publication	STACS 2005
Place of Publication	Berlin Heidelberg
Publisher	Springer
Pages	182-193
Volume	3404
ISBN (Print)	3-540-24998-2
Publication status	Published - 2005
Event	Annual Symposium on Theoretical Aspects of Computer Science - Stuttgart, Germany Duration: 24 Feb 2005 → 26 Feb 2005

Name	Lecture Notes in Computer Science
Publisher	Springer

Conference	Annual Symposium on Theoretical Aspects of Computer Science
Country/Territory	Germany
City	Stuttgart
Period	24/02/05 → 26/02/05

Treatment code (Nähere Zuordnung)

@inproceedings{1f448299f0a1432b831b47334f5ddad6,

title = "On the computational complexity of the forcing chromatic number",

author = "Wolfgang Slany and Frank Harary and Oleg Verbitsky",

year = "2005",

language = "English",

isbn = "3-540-24998-2",

volume = "3404",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "182--193",

booktitle = "STACS 2005",

note = "Annual Symposium on Theoretical Aspects of Computer Science ; Conference date: 24-02-2005 Through 26-02-2005",

}

TY - GEN

T1 - On the computational complexity of the forcing chromatic number

AU - Slany, Wolfgang

AU - Harary, Frank

AU - Verbitsky, Oleg

PY - 2005

Y1 - 2005

M3 - Conference paper

SN - 3-540-24998-2

VL - 3404

T3 - Lecture Notes in Computer Science

SP - 182

EP - 193

BT - STACS 2005

PB - Springer

CY - Berlin Heidelberg

T2 - Annual Symposium on Theoretical Aspects of Computer Science

Y2 - 24 February 2005 through 26 February 2005

ER -