The following pages link to Anna Galluccio (Q185365):
Displaying 37 items.
- (Q403362) (redirect page) (← links)
- The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect (Q403365) (← links)
- The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect (Q740644) (← links)
- Edge-colouring of joins of regular graphs. I (Q849137) (← links)
- The stable set polytope of icosahedral graphs (Q898118) (← links)
- Gear composition and the stable set polytope (Q1003487) (← links)
- (Q1277142) (redirect page) (← links)
- On the theory of Pfaffian orientations. I: Perfect matchings and permanents (Q1277143) (← links)
- On the theory of Pfaffian orientations. II: \(T\)-joins, \(k\)-cuts, and duality of enumeration (Q1277144) (← links)
- New classes of Berge perfect graphs (Q1332433) (← links)
- Different capacities of a digraph (Q1334937) (← links)
- The rank facets of the stable set polytope for claw-free graphs (Q1354111) (← links)
- A nice class for the vertex packing problem (Q1363736) (← links)
- Polynomial time algorithms for 2-edge-connectivity augmentation problems (Q1402224) (← links)
- The complexity of \(H\)-colouring of bounded degree graphs (Q1579552) (← links)
- High-girth graphs avoiding a minor are nearly bipartite (Q1850553) (← links)
- The circular flow number of a 6-edge connected graph is less than four (Q1857409) (← links)
- Edge-colouring of joins of regular graphs. II (Q1945699) (← links)
- 2-clique-bond of stable set polyhedra (Q2446841) (← links)
- Edge-colouring of regular graphs of large degree (Q2465629) (← links)
- Improved approximation of maximum vertex cover (Q2583713) (← links)
- (Q2861525) (← links)
- Gear Composition of Stable Set Polytopes and 𝒢-Perfection (Q3169068) (← links)
- Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths (Q3195131) (← links)
- Even Directed Cycles inH-Free Digraphs (Q4209272) (← links)
- (Q4234137) (← links)
- (Q4350678) (← links)
- (Q4425950) (← links)
- (Q4474101) (← links)
- (Q4871067) (← links)
- (p,q)-odd digraphs (Q4894620) (← links)
- Cycles of Prescribed Modularity in Planar Digraphs (Q4895796) (← links)
- The stable set polytope of claw-free graphs with stability number greater than three (Q5176279) (← links)
- On the Stable Set Polytope of Claw-Free Graphs (Q5505672) (← links)
- A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs (Q5505673) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710817) (← links)
- Optimization via enumeration: A new algorithm for the max cut problem (Q5935710) (← links)
