Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

ENDM
2010

favoriteEmaildiscussreport

111views more ENDM 2010»

Clique and chromatic number of circular-perfect graphs

13 years 4 months ago

Clique and chromatic number of circular-perfect graphs

Download www.irit.fr

A main result of combinatorial optimization is that clique and chromatic number of a perfect graph are computable in polynomial time (Gr

Arnaud Pêcher, Annegret Katrin Wagler

Real-time Traffic

Chromatic Number | ENDM 2010 | Perfect Graphs | Polynomial Time |

claim paper

Related Content

» An approximate version of Hadwigers conjecture for clawfree graphs

» On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane

» On the Quantum Chromatic Number of a Graph

» The NonCrossing Graph

» Coloring a Graph Using Split Decomposition

» Coloring translates and homothets of a convex body

» Clawfree circularperfect graphs

» On the chromatic number of random geometric graphs

» Coloring copoints of a planar point set

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	ENDM
Authors	Arnaud Pêcher, Annegret Katrin Wagler

Comments (0)