3204 search results - page 106 / 641 » The b-chromatic Number of a Graph |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
JGT
2010
13 years 8 months ago
2010
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by Burr, Erd˝os, and Lov´asz. We determine the corresponding graph parameter fo...
DM
2006
13 years 10 months ago
2006
In 1985, Erdos and Ne
ESCAPE
2007
Springer
14 years 2 months ago
2007
Springer
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
CIAC
2010
Springer
14 years 7 months ago
2010
Springer
The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. In 1984, Akiyama et al. [1] stated the Linear Arboricity Conjecture...