7 citations · 7 across the 2 of their papers we have counts for
6 papers
Choosability with union separation
Mohit Kumbhat, Kevin Moss, Derrick Stolee
List coloring generalizes graph coloring by requiring the color of a vertex to be selected from a list of colors specific to that vertex. One refinement of list coloring, called ch…
(4,2)-choosability of planar graphs with forbidden structures
Zhanar Berikkyzy, Christopher Cox, Michael Dairyko +8
All planar graphs are 4-colorable and 5-choosable, while some planar graphs are not 4-choosable. Determining which properties guarantee that a planar graph can be colored using lis…
I,F-partitions of Sparse Graphs
Axel Brandt, Michael Ferrara, Mohit Kumbhat +3
A star -coloring is a proper -coloring where the union of two color classes induces a star forest. While every planar graph is 4-colorable, not every planar graph is star 4-c…
Identifying codes and searching with balls in graphs
Younjin Kim, Mohit Kumbhat, Zoltan Lorant Nagy +3
Given a graph and a positive integer we address the following combinatorial search theoretic problem: What is the minimum number of queries of the form "does an unknown ver…
Minimal abundant packings and choosability with separation
Zoltan Furedi, Alexandr Kostochka, Mohit Kumbhat
A packing of size is a system of subsets (blocks) of a -element underlying set such that each block has elements and every -set is contained in at most…
Choosability with separation of complete multipartite graphs and hypergraphs
Zoltán Füredi, Alexandr Kostochka, Mohit Kumbhat
For a hypergraph G and a positive integer s, let χ_{\ell} (G,s) be the minimum value of l such that G is L-colorable from every list L with |L(v)|=l for each v\in V(G) and |L(u)\ca…