46 search results - page 1 / 10 » Collapsible biclaw-free graphs |
79
Voted
DM
2006
15 years 14 days 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...
78
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
72
Voted
DM
2008
15 years 16 days ago
2008
181
click to vote
FSTTCS
2010
Springer
14 years 9 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...
93
Voted
STACS
1987
Springer
15 years 4 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...