Graph classes characterized both by forbidden subgraphs and degree sequences. - Michael D. Barrus; Mohit Kumbhat; Stephen G. Hartke (J. Graph Theory, 2008)

Coloring uniform hypergraphs with few edges. - Alexandr V. Kostochka; Mohit Kumbhat (Random Struct. Algorithms, 2009)

Conflict-Free Colourings of Uniform Hypergraphs With Few Edges. - Alexandr V. Kostochka; Mohit Kumbhat; Tomasz Luczak 001 (Comb. Probab. Comput., 2012)

Choosability with Separation of Complete Multipartite Graphs and Hypergraphs. - Zoltán Füredi; Alexandr V. Kostochka; Mohit Kumbhat (J. Graph Theory, 2014)

Identifying codes and searching with balls in graphs. - Younjin Kim; Mohit Kumbhat; Zoltán Lóránt Nagy; Balázs Patkós; Alexey Pokrovskiy; Máté Vizer (Discret. Appl. Math., 2015)

Non-minimal Degree-Sequence-Forcing Triples. - Michael D. Barrus; Stephen G. Hartke; Mohit Kumbhat (Graphs Comb., 2015)

I, F-partitions of sparse graphs. - Axel Brandt; Michael Ferrara; Mohit Kumbhat; Sarah Loeb; Derrick Stolee; Matthew P. Yancey (Eur. J. Comb., 2016)

(4, 2)-Choosability of Planar Graphs with Forbidden Structures. - Zhanar Berikkyzy; Christopher Cox; Michael Dairyko; Kirsten Hogenson; Mohit Kumbhat; Bernard Lidický; Kacy Messerschmidt; Kevin Moss; Kathleen Nowak; Kevin F. Palmowski; Derrick Stolee (Graphs Comb., 2017)

Choosability with union separation. - Mohit Kumbhat; Kevin Moss; Derrick Stolee (Discret. Math., 2018)

Minimal abundant packings and choosability with separation. - Zoltán Füredi; Alexandr V. Kostochka; Mohit Kumbhat (Des. Codes Cryptogr., 2024)