22 search results - page 1 / 5 » Clique and chromatic number of circular-perfect graphs |
ENDM
2010
14 years 10 months ago
2010
A main result of combinatorial optimization is that clique and chromatic number of a perfect graph are computable in polynomial time (Gr
JGT
2010
14 years 8 months ago
2010
Hadwiger’s conjecture states that every graph with chromatic number χ has a clique minor of size χ. In this paper we prove a weakened version of this conjecture for the class ...
COMBINATORICS
2004
14 years 10 months ago
2004
Let G be the intersection graph of a finite family of convex sets obtained by translations of a fixed convex set in the plane. We show that every such graph with clique number k i...
89
Voted
COMBINATORICS
2007
14 years 10 months ago
2007
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a refe...
100
click to vote
COMBINATORICS
2006
14 years 10 months ago
2006
Two sets are non-crossing if they are disjoint or one contains the other. The noncrossing graph NCn is the graph whose vertex set is the set of nonempty subsets of [n] = {1, . . ....