871 search results - page 24 / 175 » The vertex-cover polynomial of a graph |
MFCS
2009
Springer
15 years 6 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
108
click to vote
LICS
2010
IEEE
14 years 9 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
SIAMDM
2000
14 years 11 months ago
2000
A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph is a k-split graph if its vertices can be partitioned into k sets, each of which...
116
click to vote
IWOCA
2010
Springer
14 years 6 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
EJC
2007
14 years 12 months ago
2007
Given a graph we show how to construct a family of manifolds whose Euler characteristics are the values of the chromatic polynomial of the graph at various integers. The manifolds...