Nishad Kothari
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Extremal minimal bipartite matching covered graphs (available as arXiv preprint) | N/A | Paper |
| Planar cycle-extendable graphs Discrete Mathematics and Theoretical Computer Science. DMTCS | 2026-01-13 | Paper |
| Minimal braces Journal of Graph Theory | 2023-09-29 | Paper |
| Generating simple near‐bipartite bricks Journal of Graph Theory | 2023-08-22 | Paper |
| Birkhoff-von Neumann graphs that are PM-compact SIAM Journal on Discrete Mathematics | 2020-10-28 | Paper |
| Equivalence classes in matching covered graphs Discrete Mathematics | 2020-06-08 | Paper |
| On essentially 4-edge-connected cubic bricks The Electronic Journal of Combinatorics | 2020-01-27 | Paper |
| On essentially 4-edge-connected cubic bricks The Electronic Journal of Combinatorics | 2020-01-27 | Paper |
| Generating near‐bipartite bricks Journal of Graph Theory | 2019-04-25 | Paper |
| Minimal Braces | 2019-03-26 | Paper |
| On two unsolved problems concerning matching covered graphs SIAM Journal on Discrete Mathematics | 2018-07-18 | Paper |
| \(K_4\)-free and \(\overline{C_6}\)-free planar matching covered graphs Journal of Graph Theory | 2016-06-10 | Paper |
| Approximation algorithms for digraph width parameters Theoretical Computer Science | 2014-12-02 | Paper |
Research outcomes over time
This page was built for person: Nishad Kothari
