On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs
Work
Year: 2009
Type: article
Authors Arnaud Pêcher, Annegret K. Wagler
Institutions Université de Bordeaux, Laboratoire Bordelais de Recherche en Informatique, Institut national de recherche en informatique et en automatique, Institut Polytechnique de Bordeaux, Otto-von-Guericke University Magdeburg
Cites: 20
Cited by: 4
Related to: 10
FWCI: 0.602
Citation percentile (by year/subfield): 56.37
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed