3757 search results - page 20 / 752 » The overlap number of a graph |
ENDM
2010
13 years 8 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
IPL
2007
13 years 8 months ago
2007
Abstract. The intention of this note is to motivate the researchers to study Hadwiger’s conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G...
CAEPIA
2005
Springer
14 years 2 months ago
2005
Springer
PolyTope ARTMAP (PTAM) [6] is an ART neural network based on internal categories with irregular polytope (polygon in IRn ) geometry. Categories in PTAM do not overlap, so that thei...
APPML
2011
13 years 3 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 8 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...