Dinabandhu Pradhan

Generating author description...

All published works

Action	Title	Year	Authors
+	Singleton coalition graph chains	2024	Davood Bakhshesh Michael A. Henning Dinabandhu Pradhan
+	Strengthening Brooks’ chromatic bound on <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e158" altimg="si21.svg"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>6</mml:mn></mml:mrow></mml:msub></mml:math>-free graphs	2023	Uttam K. Gupta Dinabandhu Pradhan
+	Unique Response Roman Domination: Complexity and Algorithms	2023	Sumanta Banerjee Juhi Chaudhary Dinabandhu Pradhan
+ PDF Chat	Cops and robber on subclasses of P5-free graphs	2023	Uttam K. Gupta Suchismita Mishra Dinabandhu Pradhan
+	Singleton Coalition Graph Chains	2023	Davood Bakhshesh Michael A. Henning Dinabandhu Pradhan
+	List recoloring of planar graphs	2022	L. Sunil Chandran Uttam K. Gupta Dinabandhu Pradhan
+	On the coalition number of graphs	2021	Davood Bakhshesh Dinabandhu Pradhan
+	On the coalition number of trees	2021	Davood Bakhshesh Dinabandhu Pradhan
+	Cops and robber on subclasses of $P_5$-free graphs	2021	Uttam K. Gupta Suchismita Mishra Dinabandhu Pradhan
+	NP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs	2008	B. S. Panda Dinabandhu Pradhan

Common Coauthors

Coauthor	Papers Together
Uttam K. Gupta	4
Davood Bakhshesh	4
Michael A. Henning	2
Suchismita Mishra	1
Suchismita Mishra	1
L. Sunil Chandran	1
Sumanta Banerjee	1
Juhi Chaudhary	1
B. S. Panda	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Coalition graphs of paths, cycles, and trees	2021	Teresa W. Haynes Jason T. Hedetniemi Stephen T. Hedetniemi Alice A. McRae Raghuveer Mohan	2
+	The Cops and Robber game on graphs with forbidden (induced) subgraphs	2008	Gwenaël Joret Marcin Kamiński Dirk Oliver Theis	1
+ PDF Chat	Cops and Robbers on diameter two graphs	2014	Zsolt Adam Wagner	1
+ PDF Chat	The strong perfect graph theorem	2006	Maria Chudnovsky Neil Robertson Paul Seymour Robin Thomas	1
+	Constructions of<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si11.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-critical<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si12.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-free graphs	2014	Chı́nh T. Hoàng Brian Moore Daniel Recoskie Joe Sawada Martin Vatshelle	1
+	Distance-hereditary graphs are clique-perfect	2005	Chuan-Min Lee Maw‐Shang Chang	1
+	Note on a pursuit game played on graphs	1984	Thomas Andreae	1
+	Ramsey-type theorems	1989	Paul Erdős A. Hajnal	1
+	A Strengthening of Brooks' Theorem	1999	Bruce Reed	1
+ PDF Chat	Analytical approach to parallel repetition	2014	Irit Dinur David Steurer	1
+	The chromatic number of graphs which induce neither K1,3 nor K5−e	1986	Henry A. Kiersteád James H. Schmerl	1
+	Coloring a graph with <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si10.gif" display="inline" overflow="scroll"><mml:mi>Δ</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:math> colors: Conjectures equivalent to the Borodin–Kostochka conjecture that appear weaker	2014	Daniel W. Cranston Landon Rabern	1
+ PDF Chat	Meyniel’s conjecture on the cop number: A survey	2012	William Baird Anthony Bonato	1
+	On an upper bound of a graph's chromatic number, depending on the graph's degree and density	1977	O. V. Borodin Alexandr Kostochka	1
+	Homogeneous sets and domination: A linear time algorithm for distance—hereditary graphs	2001	Falk Nicolai Thomas Szymczak	1
+ PDF Chat	A note on the Hamiltonian Circuit Problem on directed path graphs	1989	Giri Narasimhan	1
+	Coloring the hypergraph of maximal cliques of a graph with no long path	2003	Sylvain Gravier Chı́nh T. Hoàng Frédéric Maffray	1
+	Embedding subgraphs and coloring graphs under extremal degree conditions	1976	Paul A. Catlin	1
+	Linearly <i>χ</i>‐bounding (<i>P</i><sub>6</sub>, <i>C</i><sub>4</sub>)‐free graphs*	2019	Serge Gaspers Shenwei Huang	1
+	Cop number of $2K_2$-free graphs	2019	Vaidy Sivaraman Stephen M. Testa	1
+	Perfect Roman domination in graphs	2019	S. S. Banerjee Julian Keil D. Pradhan	1
+	The Cop Number of Graphs with Forbidden Induced Subgraphs	2019	Mingrui Liu	1
+ PDF Chat	Algorithmic aspects of Roman domination in graphs	2020	Padamutham Chakradhar P. Venkata Subba Reddy	1
+	Cops and robbers on graphs with a set of forbidden induced subgraphs	2020	Masood Masjoody Ladislav Stacho	1
+	Borodin–Kostochka’s conjecture on $$(P_5,C_4)$$-free graphs	2020	Uttam K. Gupta D. Pradhan	1
+ PDF Chat	Cops and robbers on 2K2-free graphs	2021	Jérémie Turcotte	1
+ PDF Chat	Coloring Claw-Free Graphs with $\Delta-1$ Colors	2013	Daniel W. Cranston Landon Rabern	1
+ PDF Chat	Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors	2022	Daniel W. Cranston Hudson Lafayette Landon Rabern	1
+	Paw-free graphs	1988	Stephan Olariu	1
+ PDF Chat	On Meyniel's conjecture of the cop number	2011	Linyuan Lü Xing Peng	1
+ PDF Chat	Problems from the world surrounding perfect graphs	1987	András Gyárfás	1