5 citations · 17 across the 14 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
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…