Mohit Kumbhat

According to our database, Mohit Kumbhat authored at least 10 papers between 2008 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Minimal abundant packings and choosability with separation.

Zoltán Füredi, Alexandr V. Kostochka, Mohit Kumbhat

Des. Codes Cryptogr., December, 2024

2018

Choosability with union separation.

Mohit Kumbhat, Kevin Moss, Derrick Stolee

Discret. Math., 2018

2017

(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

2016

I, F-partitions of sparse graphs.

Axel Brandt, Michael Ferrara, Mohit Kumbhat, Sarah Loeb, Derrick Stolee, Matthew P. Yancey

Eur. J. Comb., 2016

2015

Non-minimal Degree-Sequence-Forcing Triples.

Michael D. Barrus, Stephen G. Hartke, Mohit Kumbhat

Graphs Comb., 2015

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

2014

Choosability with Separation of Complete Multipartite Graphs and Hypergraphs.

Zoltán Füredi, Alexandr V. Kostochka, Mohit Kumbhat

J. Graph Theory, 2014

2012

Conflict-Free Colourings of Uniform Hypergraphs With Few Edges.

Alexandr V. Kostochka, Mohit Kumbhat, Tomasz Luczak

Comb. Probab. Comput., 2012

2009

Coloring uniform hypergraphs with few edges.

Alexandr V. Kostochka, Mohit Kumbhat

Random Struct. Algorithms, 2009

2008

Graph classes characterized both by forbidden subgraphs and degree sequences.

Michael D. Barrus, Mohit Kumbhat, Stephen G. Hartke

J. Graph Theory, 2008