The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Cláudio Leonardo Lucchesi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Marcelo H. de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty
    Ear Decompositions of Matching Covered Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1999, v:19, n:2, pp:151-174 [Journal]
  2. Marcelo H. de Carvalho, Cláudio Leonardo Lucchesi
    Matching Covered Graphs and Subdivisions ofK4and[formula]. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:2, pp:263-268 [Journal]
  3. Marcelo H. de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty
    Optimal Ear Decompositions of Matching Covered Graphs and Bases for the Matching Lattice. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:85, n:1, pp:59-93 [Journal]
  4. Marcelo H. de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty
    On a Conjecture of Lovász Concerning Bricks: I. The Characteristic of a Matching Covered Graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:85, n:1, pp:94-136 [Journal]
  5. Marcelo H. de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty
    On a Conjecture of Lovász Concerning Bricks: II. Bricks of Finite Characteristic. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:85, n:1, pp:137-180 [Journal]
  6. Marcelo H. de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty
    The perfect matching polytope and solid bricks. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:92, n:2, pp:319-324 [Journal]
  7. Shinya Fujita, Ken-ichi Kawarabayashi, Cláudio Leonardo Lucchesi, Katsuhiro Ota, Michael D. Plummer, Akira Saito
    A pair of forbidden subgraphs and perfect matchings. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:3, pp:315-324 [Journal]
  8. Cláudio Leonardo Lucchesi, Célia Picinin de Mello, Jayme Luiz Szwarcfiter
    On clique-complete graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:183, n:1-3, pp:247-254 [Journal]

  9. Recognizing near-bipartite Pfaffian graphs in polynomial time. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002