779 search results - page 30 / 156 » A graph polynomial for independent sets of bipartite graphs |
105
click to vote
COMBINATORICA
2008
15 years 2 months ago
2008
It is a long standing open problem to find an explicit description of the stable set polytope of clawfree graphs. Yet more than 20 years after the discovery of a polynomial algori...
121
click to vote
JCP
2006
15 years 1 months ago
2006
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
111
click to vote
IJCAI
2001
15 years 3 months ago
2001
We give a graph theoretical characterization of answer sets of normal logic programs. We show that there is a one-to-one correspondence between answer sets and a special, non-stan...
SIAMDM
2008
15 years 1 months ago
2008
For a rooted graph G, let EV (G; p) be the expected number of vertices reachable from the root when each edge has an independent probability p of operating successfully. We examine...
118
click to vote
DM
2008
15 years 2 months ago
2008
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...