140 search results - page 21 / 28 » Maximum Series-Parallel Subgraph |
DM
2008
14 years 9 months ago
2008
The coefficient of fragmentability of a class of graphs measures the proportion of vertices that need to be removed from the graphs in the class in order to leave behind bounded s...
COMBINATORICS
2006
14 years 9 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
83
Voted
COMBINATORICS
2006
14 years 9 months ago
2006
A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc(G), and the fractional biclique partition number, bp(G), o...
COMBINATORICS
2006
14 years 9 months ago
2006
A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G. A set S o...
DAM
2007
14 years 9 months ago
2007
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...