3204 search results - page 7 / 641 » The b-chromatic Number of a Graph |
ENDM
2010
13 years 7 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
APPML
2011
13 years 2 months ago
2011
Zykov designed one of the oldest known family of triangle-free graphs with arbitrarily high chromatic number. We determine the fractional chromatic number of the Zykov product of ...
STOC
2001
ACM
14 years 7 months ago
2001
ACM
We show that for every fixed ? there is a quadratic time algorithm that decides whether a given graph has crossing number at most and, if this is the case, computes a drawing of t...
JCT
2008
13 years 7 months ago
2008
Let G be a regular graph and H a subgraph on the same vertex set. We give surprisingly compact formulas for the number of copies of H one expects to find in a random subgraph of G...
COMBINATORICS
2004
13 years 7 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...