Anna Galluccio

From MaRDI portal
Revision as of 07:55, 6 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:185365

Available identifiers

zbMath Open galluccio.annaMaRDI QIDQ185365

List of research outcomes

PublicationDate of PublicationType
The stable set polytope of icosahedral graphs2015-12-08Paper
Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths2015-10-21Paper
The stable set polytope of claw-free graphs with stability number greater than three2015-03-03Paper
The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect2014-09-04Paper
The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect2014-08-29Paper
2-clique-bond of stable set polyhedra2014-04-22Paper
https://portal.mardi4nfdi.de/entity/Q28615252013-11-08Paper
Edge-colouring of joins of regular graphs. II2013-04-08Paper
Gear Composition of Stable Set Polytopes and 𝒢-Perfection2011-04-27Paper
Edge-colouring of joins of regular graphs. I2010-02-24Paper
Gear composition and the stable set polytope2009-03-04Paper
On the Stable Set Polytope of Claw-Free Graphs2009-01-27Paper
A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs2009-01-27Paper
Edge-colouring of regular graphs of large degree2008-01-07Paper
Improved approximation of maximum vertex cover2006-01-18Paper
Graph-Theoretic Concepts in Computer Science2005-12-08Paper
https://portal.mardi4nfdi.de/entity/Q44741012004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44259502003-09-14Paper
Polynomial time algorithms for 2-edge-connectivity augmentation problems2003-08-19Paper
The circular flow number of a 6-edge connected graph is less than four2003-02-18Paper
High-girth graphs avoiding a minor are nearly bipartite2002-12-10Paper
Optimization via enumeration: A new algorithm for the max cut problem2001-06-26Paper
The complexity of \(H\)-colouring of bounded degree graphs2001-03-04Paper
https://portal.mardi4nfdi.de/entity/Q42341371999-11-03Paper
Even Directed Cycles inH-Free Digraphs1999-08-23Paper
On the theory of Pfaffian orientations. I: Perfect matchings and permanents1999-02-02Paper
On the theory of Pfaffian orientations. II: \(T\)-joins, \(k\)-cuts, and duality of enumeration1999-02-02Paper
https://portal.mardi4nfdi.de/entity/Q43506781998-11-01Paper
A nice class for the vertex packing problem1997-12-22Paper
The rank facets of the stable set polytope for claw-free graphs1997-05-05Paper
(p,q)-odd digraphs1997-04-07Paper
Cycles of Prescribed Modularity in Planar Digraphs1996-10-16Paper
https://portal.mardi4nfdi.de/entity/Q48710671996-08-13Paper
New classes of Berge perfect graphs1995-02-28Paper
Different capacities of a digraph1994-09-26Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Anna Galluccio