| 2008 |
|---|
| 12 | EE | Flavia Bonomo,
Maria Chudnovsky,
Guillermo Durán:
Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs.
Discrete Applied Mathematics 156(7): 1058-1082 (2008) |
| 11 | EE | Flavia Bonomo,
Guillermo Durán,
L. N. Grippo,
Martín Darío Safe:
Partial Characterizations of Circular-Arc Graphs.
Electronic Notes in Discrete Mathematics 30: 45-50 (2008) |
| 10 | EE | Flavia Bonomo,
Guillermo Durán,
Francisco J. Soulignac,
Gabriel Sueiro:
Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs.
Electronic Notes in Discrete Mathematics 30: 51-56 (2008) |
| 2006 |
|---|
| 9 | | Flavia Bonomo,
Guillermo Durán,
Marina Groshaus,
Jayme Luiz Szwarcfiter:
On clique-perfect and K-perfect graphs.
Ars Comb. 80: (2006) |
| 8 | EE | Pablo Burzyn,
Flavia Bonomo,
Guillermo Durán:
NP-completeness results for edge modification problems.
Discrete Applied Mathematics 154(13): 1824-1844 (2006) |
| 7 | EE | Flavia Bonomo:
Self-clique Helly circular-arc graphs.
Discrete Mathematics 306(6): 595-597 (2006) |
| 6 | EE | Flavia Bonomo,
Guillermo Durán,
Javier Marenco:
Exploring the complexity boundary between coloring and list-coloring.
Electronic Notes in Discrete Mathematics 25: 41-47 (2006) |
| 5 | EE | Flavia Bonomo,
Guillermo Durán,
Min Chih Lin,
Jayme Luiz Szwarcfiter:
On Balanced Graphs.
Math. Program. 105(2-3): 233-250 (2006) |
| 2005 |
|---|
| 4 | EE | Flavia Bonomo,
Mariano Cecowski:
Between coloring and list-coloring: mu-coloring.
Electronic Notes in Discrete Mathematics 19: 117-123 (2005) |
| 3 | EE | Flavia Bonomo,
Maria Chudnovsky,
Guillermo Durán:
Partial characterizations of clique-perfect graphs.
Electronic Notes in Discrete Mathematics 19: 95-101 (2005) |
| 2 | EE | Flavia Bonomo,
Guillermo Durán:
Characterization and recognition of Helly circular-arc clique-perfect graphs.
Electronic Notes in Discrete Mathematics 22: 147-150 (2005) |
| 2004 |
|---|
| 1 | EE | Pablo Burzyn,
Flavia Bonomo,
Guillermo Durán:
Computational complexity of edge modification problems in different classes of graphs.
Electronic Notes in Discrete Mathematics 18: 41-46 (2004) |
