147 search results - page 18 / 30 » Vertex partitions of chordal graphs |
NETWORKS
2010
14 years 10 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
107
click to vote
CPC
2004
14 years 11 months ago
2004
The strong chromatic number, S(G), of an n-vertex graph G is the smallest number k such that after adding kn/k-n isolated vertices to G and considering any partition of the vertic...
96
Voted
CPC
2007
14 years 11 months ago
2007
Consider two graphs G1 and G2 on the same vertex set V and suppose that Gi has mi edges. Then there is a bipartition of V into two classes A and B so that for both i = 1, 2 we hav...
107
click to vote
IWPEC
2009
Springer
15 years 6 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
GD
2008
Springer
15 years 25 days ago
2008
Springer
Abstract. Problems in simultaneous graph drawing involve the layout of several graphs on a shared vertex set. This paper describes a Graph Simultaneous Embedding Tool, GraphSET, de...