5 citations · 11 across the 3 of their papers we have counts for
3 papers
math.CO2018★ 5 cited
Birkhoff-von Neumann Graphs that are PM-compact
Marcelo H. de Carvalho, Nishad Kothari, Xiumei Wang +1
A well-studied geometric object in combinatorial optimization is the perfect matching polytope of a graph . In any investigation concerning the perfect matching polytope, one ma…
math.CO2018★ 4 cited
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…
math.CO2017★ 2 cited
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…