On the computational complexity of the forcing chromatic number

Wolfgang Slany, Frank Harary, Oleg Verbitsky

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Original languageEnglish
Title of host publicationSTACS 2005
Place of PublicationBerlin Heidelberg
PublisherSpringer
Pages182-193
Volume3404
ISBN (Print)3-540-24998-2
Publication statusPublished - 2005
EventAnnual Symposium on Theoretical Aspects of Computer Science - Stuttgart, Germany
Duration: 24 Feb 200526 Feb 2005

Publication series

NameLecture Notes in Computer Science
PublisherSpringer

Conference

ConferenceAnnual Symposium on Theoretical Aspects of Computer Science
CountryGermany
CityStuttgart
Period24/02/0526/02/05

Treatment code (Nähere Zuordnung)

  • Basic - Fundamental (Grundlagenforschung)
  • Application
  • Theoretical
  • Experimental

Cite this

Slany, W., Harary, F., & Verbitsky, O. (2005). On the computational complexity of the forcing chromatic number. In STACS 2005 (Vol. 3404, pp. 182-193). (Lecture Notes in Computer Science). Berlin Heidelberg: Springer.

On the computational complexity of the forcing chromatic number. / Slany, Wolfgang; Harary, Frank; Verbitsky, Oleg.

STACS 2005. Vol. 3404 Berlin Heidelberg : Springer, 2005. p. 182-193 (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Slany, W, Harary, F & Verbitsky, O 2005, On the computational complexity of the forcing chromatic number. in STACS 2005. vol. 3404, Lecture Notes in Computer Science, Springer, Berlin Heidelberg, pp. 182-193, Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, 24/02/05.
Slany W, Harary F, Verbitsky O. On the computational complexity of the forcing chromatic number. In STACS 2005. Vol. 3404. Berlin Heidelberg: Springer. 2005. p. 182-193. (Lecture Notes in Computer Science).
Slany, Wolfgang ; Harary, Frank ; Verbitsky, Oleg. / On the computational complexity of the forcing chromatic number. STACS 2005. Vol. 3404 Berlin Heidelberg : Springer, 2005. pp. 182-193 (Lecture Notes in Computer Science).
@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",

}

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 contribution

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

ER -