Nishad Kothari

activity

20112026

most citedBirkhoff-von Neumann Graphs that are PM-compact

5 citations · 17 across the 14 of their papers we have counts for

collaborators

Showing 2017Show all

2 papers · 1 filter

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 $C := \partial (X)$ of a matching covered graph $G$ is a separating cut if both its $C$ -contractions $G / X$ and $G / X$ are also matching covered. A brick is solid if it…

math.CO2017

Generating simple near-bipartite bricks

Nishad Kothari, Marcelo H. de Carvalho

A brick is a $3$ -connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick $G$ is near-bipartite if it has a pair o…