5 search results - page 1 / 1 » The k-in-a-path Problem for Claw-free Graphs |
WG
2005
Springer
13 years 10 months ago
2005
Springer
To decide whether a line graph (hence a claw-free graph) of maximum degree five admits a stable cutset has been proven to be an NP-complete problem. The same result has been known...
WG
2009
Springer
13 years 11 months ago
2009
Springer
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...
SIAMDM
2010
13 years 3 months ago
2010
A connected graph G is called t-perfect if its stable set polytope is determined by the non-negativity, edge and odd-cycle inequalities. Moreover, G is called strongly t-perfect i...
SIAMDM
2002
13 years 4 months ago
2002
Let Hn be the number of claw-free cubic graphs on 2n labeled nodes. Combinatorial reductions are used to derive a second order, linear homogeneous differential equation with polyno...
ESA
2006
Springer
13 years 8 months ago
2006
Springer
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...