1395 search results - page 59 / 279 » (k, )-Distance-Hereditary Graphs |
CVIU
2010
15 years 3 months ago
2010
83
Voted
TODAES
1998
15 years 3 months ago
1998
104
click to vote
STOC
2004
ACM
16 years 3 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.
110
Voted
WG
2005
Springer
15 years 9 months ago
2005
Springer
To decide whether a line graph (hence a claw-free graph) of maximum degree five admits a stable cutset has been proven to be an NP-complete problem. The same result has been known...