CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Filters
2 research outputs found
An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
Author
Alizadeh
Andreou
+46 more
Berge
Bixby
Brandstädt
Burlet
Chudnovsky
Chudnovsky
Chudnovsky
Chvátal
Cunningham
Demange
Erdős
Frota
Furini
Galli
Golumbic
Grötschel
Grötschel
Grötschel
Hale
Held
Hoshino
Hougardy
Knuth
Lewis
Li
Lovász
Lovász
Malaguti
Markenzon
Marx
McDiarmid
Mehrotra
Méndez-Díaz
Nesterov
Oylum Şeker
Roussel
Sherali
Spinrad
Tınaz Ekim
Tomita
Tomita
Wu
Yıldırım
Z. Caner Taşkın
Şeker
Şeker
Publication venue
'Elsevier BV'
Publication date
Field of study
No full text
Crossref