Cláudio Leonardo Lucchesi - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 19 from 19

2021

Laminar tight cuts in matching covered graphsGuantao Chen, Xing Feng, Fuliang Lu, Cláudio Leonardo Lucchesi, Lianzhu Zhang. jctb, 150:177-194, 2021. [doi]

2017

Propagating Maximum Capacities for RecommendationAhcène Boubekki, Ulf Brefeld, Cláudio Leonardo Lucchesi, Wolfgang Stille. ki 2017: 72-84 [doi]

2015

Hypohamiltonian Snarks Have a 5-FlowBreno Lima de Freitas, Cândida Nunes da Silva, Cláudio Leonardo Lucchesi. endm, 50:199-204, 2015. [doi]

Thin Edges in BracesCláudio Leonardo Lucchesi, Marcelo H. de Carvalho, Uppaluri S. R. Murty. combinatorics, 22(4):4, 2015. [doi]

2013

A characterization of PM-compact bipartite and near-bipartite graphsXiumei Wang, Yixun Lin, Marcelo H. de Carvalho, Cláudio Leonardo Lucchesi, G. Sanjith, Charles H. C. Little. DM, 313(6):772-783, 2013. [doi]

2012

Contributions of Jayme Luiz Szwarcfiter to graph theory and computer scienceCláudio Leonardo Lucchesi. jbcs, 18(2):153-165, 2012. [doi]

2011

Matching signatures and Pfaffian graphsAlberto Alexandre Assis Miranda, Cláudio Leonardo Lucchesi. DM, 311(4):289-294, 2011. [doi]

2010

Recognizing near-bipartite Pfaffian graphs in polynomial timeAlberto Alexandre Assis Miranda, Cláudio Leonardo Lucchesi. DAM, 158(12):1275-1278, 2010. [doi]

2009

On the Pfaffian Number of GraphsAlberto Alexandre Assis Miranda, Cláudio Leonardo Lucchesi. endm, 35:145-150, 2009. [doi]

2008

Flow-Critical GraphsCândida Nunes da Silva, Cláudio Leonardo Lucchesi. endm, 30:165-170, 2008. [doi]

A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian GraphsAlberto Alexandre Assis Miranda, Cláudio Leonardo Lucchesi. endm, 30:171-176, 2008. [doi]

2006

A pair of forbidden subgraphs and perfect matchingsShinya Fujita, Ken-ichi Kawarabayashi, Cláudio Leonardo Lucchesi, Katsuhiro Ota, Michael D. Plummer, Akira Saito. JCT, 96(3):315-324, 2006. [doi]

2004

The perfect matching polytope and solid bricksMarcelo H. de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty. JCT, 92(2):319-324, 2004. [doi]

2002

Optimal Ear Decompositions of Matching Covered Graphs and Bases for the Matching LatticeMarcelo H. de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty. JCT, 85(1):59-93, 2002. [doi]

On a Conjecture of Lovász Concerning Bricks: I. The Characteristic of a Matching Covered GraphMarcelo H. de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty. JCT, 85(1):94-136, 2002. [doi]

On a Conjecture of Lovász Concerning Bricks: II. Bricks of Finite CharacteristicMarcelo H. de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty. JCT, 85(1):137-180, 2002. [doi]

1999

Ear Decompositions of Matching Covered GraphsMarcelo H. de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty. combinatorica, 19(2):151-174, 1999. [doi]

1998

On clique-complete graphsCláudio Leonardo Lucchesi, Célia Picinin de Mello, Jayme Luiz Szwarcfiter. DM, 183(1-3):247-254, 1998. [doi]

1996

Matching Covered Graphs and Subdivisions of::::K::::::4::and[formula]Marcelo H. de Carvalho, Cláudio Leonardo Lucchesi. JCT, 66(2):263-268, 1996. [doi]

Sign in or sign up to see more results.

runs on WebDSL