9 citations · 28 across the 12 of their papers we have counts for
12 papers
Cubic graphs, -minors and conformal minors
Nishad Kothari, Orlando Lee, Cláudio L. Lucchesi +1
It is well-known that any class of simple graphs, that is characterized by finitely many forbidden minors, also admits a characterization by finitely many forbidden topological min…
Lower Bounds for the Pfaffian Number of Graphs
Enrique Junchaya, Alberto Alexandre Assis Miranda, Cláudio L. Lucchesi
The number of perfect matchings of a -pfaffian graph can be counted by computing a linear combination of the pfaffians of matrices. The pfaffian number of a graph is the…
Laminar Tight Cuts in Matching Covered Graphs
Guantao Chen, Xing Feng, Fuliang Lu +2
An edge cut of a graph is {\it tight} if for every perfect matching of .~Barrier cuts and 2-separation cuts are called {\it ELP-cuts}, which are two i…
On essentially 4-edge-connected cubic bricks
Nishad Kothari, Marcelo H. de Carvalho, Cláudio L. Lucchesi +1
Lovász (1987) proved that every matching covered graph may be uniquely decomposed into a list of bricks (nonbipartite) and braces (bipartite); we let denote the number o…
On Two Unsolved Problems Concerning Matching Covered Graphs
Cláudio L. Lucchesi, Marcelo H. de Carvalho, Nishad Kothari +1
A cut of a matching covered graph is a separating cut if both its -contractions and are also matching covered. A brick is solid if it…
Finite-temperature supersymmetry as a constrained supergravity
C. Lucchesi
We introduce thermal superspace and show how it can be used to reconcile the superfield formulation of supersymmetry with finite temperature environments