Matching Covered Graphs and Subdivisions ofK4and[formula]. - Marcelo Henriques de Carvalho; Cláudio Leonardo Lucchesi (J. Comb. Theory B, 1996)

Ear Decompositions of Matching Covered Graphs. - Marcelo Henriques de Carvalho; Cláudio Leonardo Lucchesi; Uppaluri S. R. Murty (Comb., 1999)

Optimal Ear Decompositions of Matching Covered Graphs and Bases for the Matching Lattice. - Marcelo Henriques de Carvalho; Cláudio Leonardo Lucchesi; Uppaluri S. R. Murty (J. Comb. Theory B, 2002)

On a Conjecture of Lovász Concerning Bricks: I. The Characteristic of a Matching Covered Graph. - Marcelo Henriques de Carvalho; Cláudio Leonardo Lucchesi; Uppaluri S. R. Murty (J. Comb. Theory B, 2002)

On a Conjecture of Lovász Concerning Bricks: II. Bricks of Finite Characteristic. - Marcelo Henriques de Carvalho; Cláudio Leonardo Lucchesi; Uppaluri S. R. Murty (J. Comb. Theory B, 2002)

The perfect matching polytope and solid bricks. - Marcelo Henriques de Carvalho; Cláudio Leonardo Lucchesi; Uppaluri S. R. Murty (J. Comb. Theory B, 2004)

An O(VE) algorithm for ear decompositions of matching-covered graphs. - Marcelo Henriques de Carvalho; Joseph Cheriyan (SODA, 2005)

On the number of dissimilar pfaffian orientations of graphs. - Marcelo Henriques de Carvalho; Claudio L. Lucchesi; Uppaluri S. R. Murty (RAIRO Theor. Informatics Appl., 2005)

Graphs with independent perfect matchings. - Marcelo Henriques de Carvalho; Claudio L. Lucchesi; Uppaluri S. R. Murty (J. Graph Theory, 2005)

An O(VE) algorithm for ear decompositions of matching-covered graphs. - Marcelo Henriques de Carvalho; Joseph Cheriyan (ACM Trans. Algorithms, 2005)

How to build a brick. - Marcelo Henriques de Carvalho; Claudio L. Lucchesi; Uppaluri S. R. Murty (Discret. Math., 2006)

Vector Spaces and the Petersen Graph. - Marcelo Henriques de Carvalho; C. H. C. Little (Electron. J. Comb., 2008)

Ear Decompositions in Combed Graphs. - Marcelo Henriques de Carvalho; C. H. C. Little (Electron. J. Comb., 2008)

Circuit decompositions of join-covered graphs. - Marcelo Henriques de Carvalho; C. H. C. Little (J. Graph Theory, 2009)

Ear decompositions of join covered graphs. - Luciano L. Silveira; Marcelo Henriques de Carvalho (Electron. Notes Discret. Math., 2011)

Supervised Learning Using Local Analysis in an Optimal-Path Forest. - Willian Paraguassu Amorim; Marcelo Henriques de Carvalho (SIBGRAPI, 2012)

A generalization of Little's Theorem on Pfaffian orientations. - Marcelo Henriques de Carvalho; Claudio L. Lucchesi; Uppaluri S. R. Murty (J. Comb. Theory B, 2012)

Face Recognition Using Optimum-Path Forest Local Analysis. - Willian Paraguassu Amorim; Marcelo Henriques de Carvalho; Valguima Victoria Viana Aguiar Odakura (BRACIS, 2013)

A characterization of PM-compact bipartite and near-bipartite graphs. - Xiumei Wang; Yixun Lin; Marcelo Henriques de Carvalho; Cláudio Leonardo Lucchesi; G. Sanjith; Charles H. C. Little (Discret. Math., 2013)

On the Number of Perfect Matchings in a Bipartite Graph. - Marcelo Henriques de Carvalho; Claudio L. Lucchesi; Uppaluri S. R. Murty (SIAM J. Discret. Math., 2013)

Active Semi-supervised Learning Using Optimum-Path Forest. - Priscila T. M. Saito; Willian Paraguassu Amorim; Alexandre X. Falcão; Pedro Jussieu de Rezende; Celso T. N. Suzuki; Jancarlo F. Gomes; Marcelo Henriques de Carvalho (ICPR, 2014)

Semi-supervised Pattern Classification Using Optimum-Path Forest. - Willian Paraguassu Amorim; Alexandre Xavier Falcão; Marcelo Henriques de Carvalho (SIBGRAPI, 2014)

Matching Covered Graphs with Three Removable Classes. - Marcelo Henriques de Carvalho; Charles H. C. Little (Electron. J. Comb., 2014)

The Parity of a Thicket. - Marcelo Henriques de Carvalho; Charles H. C. Little (Electron. J. Comb., 2014)

A Characterization of PM-Compact claw-Free cubic graphs. - Xiumei Wang; Weiping Shang; Yixun Lin; Marcelo Henriques de Carvalho (Discret. Math. Algorithms Appl., 2014)

Thin Edges in Braces. - Cláudio Leonardo Lucchesi; Marcelo Henriques de Carvalho; Uppaluri S. R. Murty (Electron. J. Comb., 2015)

A characterization of minimal non-Seymour graphs. - Marcelo Henriques de Carvalho; C. H. C. Little (Discret. Math., 2016)

Improving semi-supervised learning through optimum connectivity. - Willian Paraguassu Amorim; Alexandre X. Falcão; João P. Papa; Marcelo Henriques de Carvalho (Pattern Recognit., 2016)

On Two Unsolved Problems Concerning Matching Covered Graphs. - Claudio L. Lucchesi; Marcelo Henriques de Carvalho; Nishad Kothari; Uppaluri S. R. Murty (SIAM J. Discret. Math., 2018)

On Essentially 4-Edge-Connected Cubic Bricks. - Nishad Kothari; Marcelo Henriques de Carvalho; Claudio L. Lucchesi; Charles H. C. Little (Electron. J. Comb., 2020)

Generating simple near-bipartite bricks. - Nishad Kothari; Marcelo Henriques de Carvalho (J. Graph Theory, 2020)

Birkhoff-von Neumann Graphs that are PM-Compact. - Marcelo Henriques de Carvalho; Nishad Kothari; Xiumei Wang; Yixun Lin (SIAM J. Discret. Math., 2020)

Minimal braces. - Phelipe A. Fabres; Nishad Kothari; Marcelo Henriques de Carvalho (J. Graph Theory, 2021)