3204 search results - page 356 / 641 » The b-chromatic Number of a Graph |
292
click to vote
VL
2010
IEEE
15 years 5 months ago
2010
IEEE
— Euler diagrams are frequently used for visualizing information about collections of objects and form an important component of various visual languages. Properties possessed by...
184
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
181
click to vote
SIAMDM
2002
15 years 6 months ago
2002
Let Hn be the number of claw-free cubic graphs on 2n labeled nodes. Combinatorial reductions are used to derive a second order, linear homogeneous differential equation with polyno...
189
click to vote
SIAMCOMP
2010
15 years 5 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
161
click to vote
ENDM
2000
15 years 6 months ago
2000
Attempts to solve the famous Four Color Problem led to fruitful discoveries and rich coloring theories. In this talk, some old and some recent applications of tools from topology ...