The following pages link to Raffaele Mosca (Q222633):
Displaying 10 items.
- (Q5403026) (← links)
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH (Q5696971) (← links)
- Independent Sets of Maximum Weight in Apple-Free Graphs (Q5894185) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897553) (← links)
- Independent Sets of Maximum Weight in Apple-Free Graphs (Q5901364) (← links)
- On efficient domination for some classes of \(H\)-free chordal graphs (Q5918841) (← links)
- On efficient domination for some classes of \(H\)-free chordal graphs (Q5920175) (← links)
- A property about minimum edge- and minimum clique-cover of a graph (Q5952389) (← links)
- Combining decomposition approaches for the maximum weight stable set problem (Q6040632) (← links)
- Finding dominating induced matchings in \(P_{10}\)-free graphs in polynomial time (Q6201338) (← links)