721 search results - page 27 / 145 » Almost universal graphs |
104
Voted
RSA
2002
15 years 13 days ago
2002
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
90
Voted
FSTTCS
2008
Springer
15 years 1 months ago
2008
Springer
We consider the isomorphism and canonization problem for 3-connected planar graphs. The problem was known to be L -hard and in UL ∩ coUL [TW08]. In this paper, we give a determin...
82
Voted
STOC
2004
ACM
16 years 1 months ago
2004
ACM
Given d (0, ) let kd be the smallest integer k such that d < 2k log k. We prove that the chromatic number of a random graph G(n, d/n) is either kd or kd + 1 almost surely.
91
Voted
IPL
1998
15 years 13 days ago
1998
An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exis...
94
Voted
GBRPR
2009
Springer
15 years 7 months ago
2009
Springer
A universal data model, named DG, is introduced to handle vectorized data uniformly during the whole recognition process. The model supports low level graph algorithms as well as h...