Person:626769: Difference between revisions

From MaRDI portal
Person:626769
Created automatically from import231006081045
 
m AuthorDisambiguator moved page Cláudio Leonardo Lucchesi to Cláudio Leonardo Lucchesi: Duplicate
 
(One intermediate revision by the same user not shown)
(No difference)

Latest revision as of 09:11, 11 December 2023

Available identifiers

zbMath Open lucchesi.claudio-leonardoMaRDI QIDQ626769

List of research outcomes

PublicationDate of PublicationType
Perfect matchings. A theory of matching covered graphs (to appear)2024-02-23Paper
Propagating Maximum Capacities for Recommendation2022-11-02Paper
Laminar tight cuts in matching covered graphs2021-07-06Paper
On essentially 4-edge-connected cubic bricks2020-01-27Paper
On Two Unsolved Problems Concerning Matching Covered Graphs2018-07-18Paper
On tight cuts in matching covered graphs2018-01-15Paper
Hypohamiltonian snarks have a 5-flow2016-10-17Paper
Thin edges in braces2015-11-02Paper
3-Flows and Combs2014-11-17Paper
3-flows and combs2014-11-17Paper
On the Number of Perfect Matchings in a Bipartite Graph2013-09-26Paper
On the Pfaffian Number of Graphs2013-07-19Paper
A characterization of PM-compact bipartite and near-bipartite graphs2013-03-19Paper
A generalization of Little's theorem on Pfaffian orientations2013-01-14Paper
Matching signatures and Pfaffian graphs2011-02-18Paper
Recognizing near-bipartite Pfaffian graphs in polynomial time2010-08-13Paper
A lower bound on the number of removable ears of 1-extendable graphs2010-04-27Paper
Flow-Critical Graphs2008-06-05Paper
A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs2008-06-05Paper
How to build a brick2006-10-30Paper
A pair of forbidden subgraphs and perfect matchings.2006-05-18Paper
On the number of dissimilar pfaffian orientations of graphs2005-06-07Paper
The perfect matching polytope and solid bricks2005-02-16Paper
Graphs with independent perfect matchings2005-02-16Paper
https://portal.mardi4nfdi.de/entity/Q44074442003-01-01Paper
Optimal ear decompositions of matching covered graphs and bases for the matching lattice2002-12-10Paper
On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph2002-12-10Paper
On a conjecture of Lovász concerning bricks. II: Bricks of finite characteristic2002-12-10Paper
https://portal.mardi4nfdi.de/entity/Q49400832000-03-01Paper
Ear decompositions of matching covered graphs1999-12-08Paper
On clique-complete graphs1998-09-07Paper
https://portal.mardi4nfdi.de/entity/Q43863081998-08-11Paper
https://portal.mardi4nfdi.de/entity/Q43646191998-04-01Paper
Matching covered graphs and subdivisions of \(K_ 4\) and \(\bar C_ 6\)1997-01-26Paper
https://portal.mardi4nfdi.de/entity/Q48849771996-07-08Paper
Superfluous paths in strong digraphs1983-01-01Paper
Candidate keys for relations1978-01-01Paper
A Minimax Theorem for Directed Graphs1978-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


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