Claudio L. Lucchesi

18 papers B 1Journal 16Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Lower Bounds for the Pfaffian Number of Graphs.
CoRR
Enrique Junchaya, Alberto Alexandre Assis Miranda, Claudio L. Lucchesi
2020 J jnl
On Essentially 4-Edge-Connected Cubic Bricks.
Electron. J. Comb.
Nishad Kothari, Marcelo Henriques de Carvalho, Claudio L. Lucchesi, Charles H. C. Little
2018 J jnl
On Two Unsolved Problems Concerning Matching Covered Graphs.
SIAM J. Discret. Math.
Claudio L. Lucchesi, Marcelo Henriques de Carvalho, Nishad Kothari, Uppaluri S. R. Murty
2014 J jnl
3-Flows and Combs.
J. Graph Theory
Cândida Nunes da Silva, Claudio L. Lucchesi
2013 J jnl
On the Number of Perfect Matchings in a Bipartite Graph.
SIAM J. Discret. Math.
Marcelo Henriques de Carvalho, Claudio L. Lucchesi, Uppaluri S. R. Murty
2013 J jnl
Snarks and Flow-Critical Graphs.
Electron. Notes Discret. Math.
Cândida Nunes da Silva, Lissa Pesci, Claudio L. Lucchesi
2012 J jnl
A generalization of Little's Theorem on Pfaffian orientations.
J. Comb. Theory B
Marcelo Henriques de Carvalho, Claudio L. Lucchesi, Uppaluri S. R. Murty
2010 J jnl
A lower bound on the number of removable ears of 1-extendable graphs.
Discret. Math.
Shaohui Zhai, Claudio L. Lucchesi, Xiaofeng Guo
2006 J jnl
How to build a brick.
Discret. Math.
Marcelo Henriques de Carvalho, Claudio L. Lucchesi, Uppaluri S. R. Murty
2005 J jnl
Graphs with independent perfect matchings.
J. Graph Theory
Marcelo Henriques de Carvalho, Claudio L. Lucchesi, Uppaluri S. R. Murty
2005 J jnl
On the number of dissimilar pfaffian orientations of graphs.
RAIRO Theor. Informatics Appl.
Marcelo Henriques de Carvalho, Claudio L. Lucchesi, Uppaluri S. R. Murty
2001 J jnl
Contributions of Jayme Luiz Szwarcfiter to graph theory and computer science.
J. Braz. Comput. Soc.
Claudio L. Lucchesi
1998 B ed.
LATIN '98: Theoretical Informatics, Third Latin American Symposium, Campinas, Brazil, April, 20-24, 1998, Proceedings
LATIN
Claudio L. Lucchesi, Arnaldo V. Moura
1997 — conf
Minimax relations for T-join packing problems.
ISTCS
Jaime Cohen, Claudio L. Lucchesi
1997 J jnl
On the Connection between the Undirected and the Acyclic Directed Two Disjoint Paths Problem.
Ars Comb.
Claudio L. Lucchesi, Maria Cecilia M. T. Giglio
1993 J jnl
Applications of Finite Automata Representing Large Vocabularies.
Softw. Pract. Exp.
Claudio L. Lucchesi, Tomasz Kowaltowski
1983 J jnl
Superfluous paths in strong digraphs.
Discret. Math.
Claudio L. Lucchesi, Jeffrey A. Ross
1978 J jnl
Candidate Keys for Relations.
J. Comput. Syst. Sci.
Claudio L. Lucchesi, Sylvia L. Osborn