Mohit Kumbhat, Ph.D.
Affiliations: | 2012 | Mathematics | University of Illinois, Urbana-Champaign, Urbana-Champaign, IL |
Area:
MathematicsGoogle:
"Mohit Kumbhat"Parents
Sign in to add mentorZoltan Furedi | grad student | 2012 | UIUC | |
(Colorings and list colorings of graphs and hypergraphs.) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Kumbhat M, Moss K, Stolee D. (2018) Choosability with union separation Discrete Mathematics. 341: 600-605 |
Brandt A, Ferrara M, Kumbhat M, et al. (2016) I,F-partitions of sparse graphs European Journal of Combinatorics. 57: 1-12 |
Kim Y, Kumbhat M, Nagy ZL, et al. (2015) Identifying codes and searching with balls in graphs Discrete Applied Mathematics. 193: 39-47 |
Barrus MD, Hartke SG, Kumbhat M. (2015) Non-minimal Degree-Sequence-Forcing Triples Graphs and Combinatorics. 31: 1189-1209 |
Füredi Z, Kostochka A, Kumbhat M. (2014) Choosability with separation of complete multipartite graphs and hypergraphs Journal of Graph Theory. 76: 129-137 |
Kostochka A, Kumbhat M, Łuczak T. (2012) Conflict-free colourings of uniform hypergraphs with few edges Combinatorics Probability and Computing. 21: 611-622 |
Kostochka AV, Kumbhat M, Rödl V. (2010) Coloring uniform hypergraphs with small edge degrees Bolyai Society Mathematical Studies. 20: 213-238 |
Kostochka AV, Kumbhat M. (2009) Coloring uniform hypergraphs with few edges Random Structures and Algorithms. 35: 348-368 |
Barras MD, Kumbhat M, Hartke SG. (2008) Graph classes characterized both by forbidden subgraphs and degree sequences Journal of Graph Theory. 57: 131-148 |