Marcelo Henriques de Carvalho

J. Graph Theory, 2021

2020

Birkhoff-von Neumann Graphs that are PM-Compact.

[BibT_eX]

[DOI]

Xiumei Wang

Yixun Lin

SIAM J. Discret. Math., 2020

Generating simple near-bipartite bricks.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

On Essentially 4-Edge-Connected Cubic Bricks.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

2018

On Two Unsolved Problems Concerning Matching Covered Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

2016

Improving semi-supervised learning through optimum connectivity.

[BibT_eX]

[DOI]

Alexandre X. Falcão

João P. Papa

Pattern Recognit., 2016

A characterization of minimal non-Seymour graphs.

[BibT_eX]

[DOI]

Discret. Math., 2016

2015

Thin Edges in Braces.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

2014

A Characterization of PM-Compact claw-Free cubic graphs.

[BibT_eX]

[DOI]

Xiumei Wang

Weiping Shang

Yixun Lin

Discret. Math. Algorithms Appl., 2014

The Parity of a Thicket.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

Matching Covered Graphs with Three Removable Classes.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

Semi-supervised Pattern Classification Using Optimum-Path Forest.

[BibT_eX]

[DOI]

Alexandre Xavier Falcão

Proceedings of the 27th SIBGRAPI Conference on Graphics, Patterns and Images, 2014

Active Semi-supervised Learning Using Optimum-Path Forest.

[BibT_eX]

[DOI]

Priscila T. M. Saito

Alexandre X. Falcão

Pedro Jussieu de Rezende

Celso T. N. Suzuki

Jancarlo F. Gomes

Proceedings of the 22nd International Conference on Pattern Recognition, 2014

2013

On the Number of Perfect Matchings in a Bipartite Graph.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

A characterization of PM-compact bipartite and near-bipartite graphs.

[BibT_eX]

[DOI]

Xiumei Wang

Yixun Lin

G. Sanjith

Discret. Math., 2013

Face Recognition Using Optimum-Path Forest Local Analysis.

[BibT_eX]

[DOI]

Valguima Victoria Viana Aguiar Odakura

Proceedings of the Brazilian Conference on Intelligent Systems, 2013

2012

A generalization of Little's Theorem on Pfaffian orientations.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2012

Supervised Learning Using Local Analysis in an Optimal-Path Forest.

[BibT_eX]

[DOI]

Proceedings of the 25th SIBGRAPI Conference on Graphics, Patterns and Images, 2012

2011

Ear decompositions of join covered graphs.

[BibT_eX]

[DOI]

Luciano L. Silveira

Electron. Notes Discret. Math., 2011

2009

Circuit decompositions of join-covered graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2009

2008

Ear Decompositions in Combed Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

Vector Spaces and the Petersen Graph.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

2006

How to build a brick.

[BibT_eX]

[DOI]

Discret. Math., 2006

2005

An O(VE) algorithm for ear decompositions of matching-covered graphs.

[BibT_eX]

[DOI]

Joseph Cheriyan

ACM Trans. Algorithms, 2005

Graphs with independent perfect matchings.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

On the number of dissimilar pfaffian orientations of graphs.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2005

An O(VE) algorithm for ear decompositions of matching-covered graphs.

[BibT_eX]

[DOI]

Joseph Cheriyan

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

The perfect matching polytope and solid bricks.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2004

2002

On a Conjecture of Lovász Concerning Bricks: II. Bricks of Finite Characteristic.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2002

On a Conjecture of Lovász Concerning Bricks: I. The Characteristic of a Matching Covered Graph.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2002

Optimal Ear Decompositions of Matching Covered Graphs and Bases for the Matching Lattice.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2002

1999

Ear Decompositions of Matching Covered Graphs.

[BibT_eX]

[DOI]

Comb., 1999

1996

Matching Covered Graphs and Subdivisions ofK4and[formula].

[BibT_eX]

[DOI]