Kothari, Nishad

1. On essentially 4-edge-connected cubic bricks
   2018/03/23 by Kothari, Nishad, de Carvalho, Marcelo H., Lucchesi, Cláudio L. +1 · 3 citations
   #05C40 #05C70 #05C75 #Combinatorics (math.CO) #FOS: Mathematics
2. On Two Unsolved Problems Concerning Matching Covered Graphs
   2017/05/26 by Lucchesi, Cláudio L., de Carvalho, Marcelo H., Kothari, Nishad +1 · 1 citation
   #Combinatorics (math.CO) #FOS: Mathematics
3. Birkhoff-von Neumann Graphs that are PM-compact
   2018/07/19 by Marcelo H. de Carvalho, Nishad Kothari, de Carvalho, Marcelo H. +4 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics #Graph Labeling and Dimension Problems
4. Equivalence classes in matching covered graphs
   2019/02/25 by Fuliang Lu, Nishad Kothari, Lu, Fuliang +5 · 1 citation
   Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #graph theory and CDMA systems
5. Extremal minimal bipartite matching covered graphs
   2024/04/09 by Mallik, Amit Kumar, Diwan, Ajit A., Kothari, Nishad · 1 citation
   #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics