Cláudio Leonardo Lucchesi

Available identifiers

zbMath Open lucchesi.claudio-leonardoMaRDI QIDQ626769

List of research outcomes

Publication	Date of Publication	Type
Perfect matchings. A theory of matching covered graphs (to appear)	2024-02-23	Paper
Propagating Maximum Capacities for Recommendation	2022-11-02	Paper
Laminar tight cuts in matching covered graphs	2021-07-06	Paper
On essentially 4-edge-connected cubic bricks	2020-01-27	Paper
On Two Unsolved Problems Concerning Matching Covered Graphs	2018-07-18	Paper
On tight cuts in matching covered graphs	2018-01-15	Paper
Hypohamiltonian snarks have a 5-flow	2016-10-17	Paper
Thin edges in braces	2015-11-02	Paper
3-Flows and Combs	2014-11-17	Paper
3-flows and combs	2014-11-17	Paper
On the Number of Perfect Matchings in a Bipartite Graph	2013-09-26	Paper
On the Pfaffian Number of Graphs	2013-07-19	Paper
A characterization of PM-compact bipartite and near-bipartite graphs	2013-03-19	Paper
A generalization of Little's theorem on Pfaffian orientations	2013-01-14	Paper
Matching signatures and Pfaffian graphs	2011-02-18	Paper
Recognizing near-bipartite Pfaffian graphs in polynomial time	2010-08-13	Paper
A lower bound on the number of removable ears of 1-extendable graphs	2010-04-27	Paper
Flow-Critical Graphs	2008-06-05	Paper
A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs	2008-06-05	Paper
How to build a brick	2006-10-30	Paper
A pair of forbidden subgraphs and perfect matchings.	2006-05-18	Paper
On the number of dissimilar pfaffian orientations of graphs	2005-06-07	Paper
The perfect matching polytope and solid bricks	2005-02-16	Paper
Graphs with independent perfect matchings	2005-02-16	Paper
https://portal.mardi4nfdi.de/entity/Q4407444	2003-01-01	Paper
Optimal ear decompositions of matching covered graphs and bases for the matching lattice	2002-12-10	Paper
On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph	2002-12-10	Paper
On a conjecture of Lovász concerning bricks. II: Bricks of finite characteristic	2002-12-10	Paper
https://portal.mardi4nfdi.de/entity/Q4940083	2000-03-01	Paper
Ear decompositions of matching covered graphs	1999-12-08	Paper
On clique-complete graphs	1998-09-07	Paper
https://portal.mardi4nfdi.de/entity/Q4386308	1998-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q4364619	1998-04-01	Paper
Matching covered graphs and subdivisions of \(K_ 4\) and \(\bar C_ 6\)	1997-01-26	Paper
https://portal.mardi4nfdi.de/entity/Q4884977	1996-07-08	Paper
Superfluous paths in strong digraphs	1983-01-01	Paper
Candidate keys for relations	1978-01-01	Paper
A Minimax Theorem for Directed Graphs	1978-01-01	Paper

Research outcomes over time

This page was built for person: Cláudio Leonardo Lucchesi