Candidate Keys for Relations. - Claudio L. Lucchesi; Sylvia L. Osborn (J. Comput. Syst. Sci., 1978)

Superfluous paths in strong digraphs. - Claudio L. Lucchesi; Jeffrey A. Ross (Discret. Math., 1983)

Applications of Finite Automata Representing Large Vocabularies. - Claudio L. Lucchesi; Tomasz Kowaltowski (Softw. Pract. Exp., 1993)

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

Minimax relations for T-join packing problems. - Jaime Cohen; Claudio L. Lucchesi (ISTCS, 1997)

On the Connection between the Undirected and the Acyclic Directed Two Disjoint Paths Problem. - Claudio L. Lucchesi; Maria Cecilia M. T. Giglio (Ars Comb., 1997)

On clique-complete graphs. - Cláudio Leonardo Lucchesi; Célia Picinin de Mello; Jayme Luiz Szwarcfiter (Discret. Math., 1998)

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

Contributions of Jayme Luiz Szwarcfiter to graph theory and computer science. - Claudio L. Lucchesi (J. Braz. Comput. Soc., 2001)

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)

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)

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

A pair of forbidden subgraphs and perfect matchings. - Shinya Fujita 001; Ken-ichi Kawarabayashi; Cláudio Leonardo Lucchesi; Katsuhiro Ota; Michael D. Plummer; Akira Saito (J. Comb. Theory B, 2006)

A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs. - Alberto Alexandre Assis Miranda; Cláudio Leonardo Lucchesi (Electron. Notes Discret. Math., 2008)

Flow-Critical Graphs. - Cândida Nunes da Silva; Cláudio Leonardo Lucchesi (Electron. Notes Discret. Math., 2008)

On the Pfaffian Number of Graphs. - Alberto Alexandre Assis Miranda; Cláudio Leonardo Lucchesi (Electron. Notes Discret. Math., 2009)

Recognizing near-bipartite Pfaffian graphs in polynomial time. - Alberto Alexandre Assis Miranda; Cláudio Leonardo Lucchesi (Discret. Appl. Math., 2010)

A lower bound on the number of removable ears of 1-extendable graphs. - Shaohui Zhai; Claudio L. Lucchesi; Xiaofeng Guo (Discret. Math., 2010)

Matching signatures and Pfaffian graphs. - Alberto Alexandre Assis Miranda; Cláudio Leonardo Lucchesi (Discret. Math., 2011)

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)

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)

Snarks and Flow-Critical Graphs. - Cândida Nunes da Silva; Lissa Pesci; Claudio L. Lucchesi (Electron. Notes 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)

3-Flows and Combs. - Cândida Nunes da Silva; Claudio L. Lucchesi (J. Graph Theory, 2014)

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

Hypohamiltonian Snarks Have a 5-Flow. - Breno Lima de Freitas; Cândida Nunes da Silva; Cláudio Leonardo Lucchesi (Electron. Notes Discret. Math., 2015)

Propagating Maximum Capacities for Recommendation. - Ahcène Boubekki; Ulf Brefeld; Cláudio Leonardo Lucchesi; Wolfgang Stille (KI, 2017)

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)

Laminar tight cuts in matching covered graphs. - Guantao Chen; Xing Feng; Fuliang Lu; Cláudio Leonardo Lucchesi; Lianzhu Zhang (J. Comb. Theory B, 2021)