496 search results - page 18 / 100 » C4-saturated bipartite graphs |
162
click to vote
DM
2006
15 years 6 months ago
2006
The forcing number of a perfect matching M of a graph G is the cardinality of the smallest subset of M that is contained in no other perfect matching of G. In this paper, we demon...
166
click to vote
JAL
2006
15 years 6 months ago
2006
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
142
click to vote
DM
2008
15 years 6 months ago
2008
Let G be a minimally k-connected graph with n nodes and m edges. Mader proved that if n 3k - 2 then m k(n - k), and for n 3k - 1 an equality is possible if, and only if, G is t...
158
click to vote
JGAA
2008
15 years 6 months ago
2008
Let G be a bipartite graph, and let e, i be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one p...
155
click to vote
FSTTCS
2007
Springer
16 years 23 days ago
2007
Springer
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...