| 2006 |
|---|
| 10 | EE | Marcelo H. de Carvalho,
Claudio L. Lucchesi,
Uppaluri S. R. Murty:
How to build a brick.
Discrete Mathematics 306(19-20): 2383-2410 (2006) |
| 2005 |
|---|
| 9 | EE | Marcelo H. de Carvalho,
Joseph Cheriyan:
An O(VE) algorithm for ear decompositions of matching-covered graphs.
SODA 2005: 415-423 |
| 8 | EE | Marcelo H. de Carvalho,
Joseph Cheriyan:
An O(VE) algorithm for ear decompositions of matching-covered graphs.
ACM Transactions on Algorithms 1(2): 324-337 (2005) |
| 7 | EE | Marcelo H. de Carvalho,
Claudio L. Lucchesi,
Uppaluri S. R. Murty:
Graphs with independent perfect matchings.
Journal of Graph Theory 48(1): 19-50 (2005) |
| 2004 |
|---|
| 6 | EE | Marcelo H. de Carvalho,
Cláudio Leonardo Lucchesi,
Uppaluri S. R. Murty:
The perfect matching polytope and solid bricks.
J. Comb. Theory, Ser. B 92(2): 319-324 (2004) |
| 2002 |
|---|
| 5 | EE | Marcelo H. de Carvalho,
Cláudio Leonardo Lucchesi,
Uppaluri S. R. Murty:
On a Conjecture of Lovász Concerning Bricks: II. Bricks of Finite Characteristic.
J. Comb. Theory, Ser. B 85(1): 137-180 (2002) |
| 4 | EE | Marcelo H. de Carvalho,
Cláudio Leonardo Lucchesi,
Uppaluri S. R. Murty:
Optimal Ear Decompositions of Matching Covered Graphs and Bases for the Matching Lattice.
J. Comb. Theory, Ser. B 85(1): 59-93 (2002) |
| 3 | EE | Marcelo H. de Carvalho,
Cláudio Leonardo Lucchesi,
Uppaluri S. R. Murty:
On a Conjecture of Lovász Concerning Bricks: I. The Characteristic of a Matching Covered Graph.
J. Comb. Theory, Ser. B 85(1): 94-136 (2002) |
| 1999 |
|---|
| 2 | EE | Marcelo H. de Carvalho,
Cláudio Leonardo Lucchesi,
Uppaluri S. R. Murty:
Ear Decompositions of Matching Covered Graphs.
Combinatorica 19(2): 151-174 (1999) |
| 1996 |
|---|
| 1 | EE | Marcelo H. de Carvalho,
Cláudio Leonardo Lucchesi:
Matching Covered Graphs and Subdivisions ofK4and[formula].
J. Comb. Theory, Ser. B 66(2): 263-268 (1996) |
