Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STACS
/
Paper
On the Computational Complexity of the Forcing Chromatic Number.
Frank Harary
,
Wolfgang Slany
,
Oleg Verbitsky
Venue
A
STACS
Year
2005
Proceedings
STACS
DBLP record
conf/stacs/HararySV05 ↗
Browse the full
STACS paper archive
.