M. Kumbhat

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Minimal abundant packings and choosability with separation Designs, Codes and Cryptography	2024-12-11	Paper
Choosability with union separation Discrete Mathematics	2018-01-19	Paper
\((4,2)\)-choosability of planar graphs with forbidden structures Graphs and Combinatorics	2017-10-11	Paper
I,F-partitions of sparse graphs European Journal of Combinatorics	2016-06-20	Paper
Non-minimal degree-sequence-forcing triples Graphs and Combinatorics	2015-09-24	Paper
Identifying codes and searching with balls in graphs Discrete Applied Mathematics	2015-07-24	Paper
Identifying codes and searching with balls in graphs Discrete Applied Mathematics	2015-07-24	Paper
Choosability with separation of complete multipartite graphs and hypergraphs Journal of Graph Theory	2014-05-28	Paper
Conflict-free colourings of uniform hypergraphs with few edges Combinatorics, Probability and Computing	2012-09-04	Paper
scientific article; zbMATH DE number 5825874 (Why is no real title available?)	2010-12-13	Paper
Coloring uniform hypergraphs with few edges Random Structures & Algorithms	2010-11-09	Paper
Graph classes characterized both by forbidden subgraphs and degree sequences Journal of Graph Theory	2008-02-13	Paper
Minimal abundant packings and choosability with separation (available as arXiv preprint)	N/A	Paper

Research outcomes over time

This page was built for person: M. Kumbhat