Cláudio Leonardo Lucchesi

Publication Activity (10 Years)

Years Active: 1996-2021
Publications (10 Years): 2

Top Topics

Bipartite Graph

Maximum Cardinality

Graph Representations

Top Venues

Electron. J. Comb.

Electron. Notes Discret. Math.

J. Braz. Comput. Soc.

Publications

Guantao Chen, Xing Feng, Fuliang Lu, Cláudio Leonardo Lucchesi, Lianzhu Zhang
Laminar tight cuts in matching covered graphs. J. Comb. Theory, Ser. B 150 (2021)
Ahcène Boubekki, Ulf Brefeld, Cláudio Leonardo Lucchesi, Wolfgang Stille
Propagating Maximum Capacities for Recommendation. KI (2017)
Cláudio Leonardo Lucchesi, Marcelo Henriques de Carvalho, Uppaluri S. R. Murty
Thin Edges in Braces. Electron. J. Comb. 22 (4) (2015)
Breno Lima de Freitas, Cândida Nunes da Silva, Cláudio Leonardo Lucchesi
Hypohamiltonian Snarks Have a 5-Flow. Electron. Notes Discret. Math. 50 (2015)
Xiumei Wang, Yixun Lin, Marcelo Henriques de Carvalho, Cláudio Leonardo Lucchesi, G. Sanjith, Charles H. C. Little
A characterization of PM-compact bipartite and near-bipartite graphs. Discret. Math. 313 (6) (2013)
Cláudio Leonardo Lucchesi
Contributions of Jayme Luiz Szwarcfiter to graph theory and computer science. J. Braz. Comput. Soc. 18 (2) (2012)
Alberto Alexandre Assis Miranda, Cláudio Leonardo Lucchesi
Matching signatures and Pfaffian graphs. Discret. Math. 311 (4) (2011)
Alberto Alexandre Assis Miranda, Cláudio Leonardo Lucchesi
Recognizing near-bipartite Pfaffian graphs in polynomial time. Discret. Appl. Math. 158 (12) (2010)
Alberto Alexandre Assis Miranda, Cláudio Leonardo Lucchesi
On the Pfaffian Number of Graphs. Electron. Notes Discret. Math. 35 (2009)
Cândida Nunes da Silva, Cláudio Leonardo Lucchesi
Flow-Critical Graphs. Electron. Notes Discret. Math. 30 (2008)
Alberto Alexandre Assis Miranda, Cláudio Leonardo Lucchesi
A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs. Electron. Notes Discret. Math. 30 (2008)
Shinya Fujita, Ken-ichi Kawarabayashi, Cláudio Leonardo Lucchesi, Katsuhiro Ota, Michael D. Plummer, Akira Saito
A pair of forbidden subgraphs and perfect matchings. J. Comb. Theory, Ser. B 96 (3) (2006)
Marcelo Henriques de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty
The perfect matching polytope and solid bricks. J. Comb. Theory, Ser. B 92 (2) (2004)
Marcelo Henriques 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) (2002)
Marcelo Henriques 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) (2002)
Marcelo Henriques 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) (2002)
Marcelo Henriques de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty
Ear Decompositions of Matching Covered Graphs. Comb. 19 (2) (1999)
Cláudio Leonardo Lucchesi, Célia Picinin de Mello, Jayme Luiz Szwarcfiter
On clique-complete graphs. Discret. Math. 183 (1-3) (1998)
Marcelo Henriques de Carvalho, Cláudio Leonardo Lucchesi
and[formula]. J. Comb. Theory, Ser. B 66 (2) (1996)