11 citations · 13 across the 7 of their papers we have counts for
8 papers
Claw-free perfect graphs are chromatic-choosable
Suchismita Mishra, Narayanan Narayanan, Umesh Shankar
We prove that every claw-free perfect graph satisfies . More strongly, if is a clique of simplicial vertices of and , every proper precolori…
Finding and Counting Patterns in Sparse Graphs
Balagopal Komarath, Anant Kumar, Suchismita Mishra +1
We consider algorithms for finding and counting small, fixed graphs in sparse host graphs. In the non-sparse setting, the parameters treedepth and treewidth play a crucial role in…
Cops and robber on subclasses of -free graphs
Uttam K. Gupta, Suchismita Mishra, Dinabandhu Pradhan
The game of cops and robber is a turn based vertex pursuit game played on a connected graph between a team of cops and a single robber. The cops and the robber move alternately alo…
Strong edge coloring of Cayley graphs and some product graphs
Suresh Dara, Suchismita Mishra, Narayanan Narayanan +1
A strong edge coloring of a graph is a proper edge coloring of such that every color class is an induced matching. The minimum number of colors required is termed the stron…
Structure of (bull, diamond)-free graphs and its applications
Suchismita Mishra
This paper discusses the complete structure of the (bull, diamond)-free graphs. As an application of that, we give the characterization of the partitionable (bull, diamond)-free gr…
Exact square coloring of subcubic planar graphs
Florent Foucaud, Hervé Hocquard, Suchismita Mishra +4
We study the exact square chromatic number of subcubic planar graphs. An exact square coloring of a graph G is a vertex-coloring in which any two vertices at distance exactly 2 rec…
Coloring (, diamond, )-free graphs
T. Karthick, Suchismita Mishra
We show that every (, diamond, )-free graph is -colorable. Moreover, we give an example of a (, diamond, )-free graph with . This generalizes s…
Chromatic bounds for some classes of -free graphs
T. Karthick, Suchismita Mishra
A hereditary class of graphs is -bounded if there is a -binding function, say such that , for every , where (…