26 search results - page 1 / 6 » Contractibility and the clique graph operator |
59
Voted
DM
2008
14 years 11 months ago
2008
92
Voted
WG
2005
Springer
15 years 4 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
69
Voted
DAM
2010
14 years 11 months ago
2010
85
Voted
JGT
2006
14 years 11 months ago
2006
Abstract: A k-tree is a chordal graph with no (k + 2)-clique. An -treepartition of a graph G is a vertex partition of G into `bags,' such that contracting each bag to a single...
69
Voted
ENDM
2007
14 years 10 months ago
2007
Let ccl(G) denote the order of the largest complete minor in a graph G (also called the contraction clique number) and let Gn,p denote a random graph on n vertices with edge probab...