Login / Signup
The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are G-perfect.
Anna Galluccio
Claudio Gentile
Paolo Ventura
Published in:
J. Comb. Theory, Ser. B (2014)
Keyphrases
</>
stable set
directed graph
small number
undirected graph
polynomial time complexity
connected graphs
computational complexity
random graphs
graph mining
weighted graph
graph structure
bipartite graph
spanning tree
graph theoretic
cnf formula
graph matching
temporal logic
knowledge acquisition