46 search results - page 1 / 10 » Collapsible biclaw-free graphs |
DM
2006
13 years 11 months ago
2006
A graph is called biclaw-free if it has no biclaw as an induced subgraph. In this note, we prove that if G is a connected bipartite biclaw-free graph with (G) 5, then G is collap...
STACS
2010
Springer
14 years 5 months ago
2010
Springer
DM
2008
13 years 11 months ago
2008
FSTTCS
2010
Springer
13 years 8 months ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
STACS
1987
Springer
14 years 2 months ago
1987
Springer
It is shown that the graph isomorphism problem is located in the low hierarchy in NP. This implies that this problem is not NPcomplete (not even under weaker forms of polynomial-ti...