The following pages link to Nishad Kothari (Q476881):
Displayed 10 items.
- Approximation algorithms for digraph width parameters (Q476883) (← links)
- Equivalence classes in matching covered graphs (Q2185935) (← links)
- On essentially 4-edge-connected cubic bricks (Q2290348) (← links)
- <i>K</i> <sub>4</sub> -free and C6¯-free Planar Matching Covered Graphs (Q2811192) (← links)
- On Two Unsolved Problems Concerning Matching Covered Graphs (Q3174694) (← links)
- Generating near‐bipartite bricks (Q4632024) (← links)
- Birkhoff--von Neumann Graphs that are PM-Compact (Q5130578) (← links)
- Minimal braces (Q6055406) (← links)
- Generating simple near‐bipartite bricks (Q6134648) (← links)
- Minimal Braces (Q6316244) (← links)