The following pages link to Dinabandhu Pradhan (Q680148):
Displayed 14 items.
- An algorithm for the maximum weight independent set problem on outerstring graphs (Q680149) (← links)
- Item:Q680148 (redirect page) (← links)
- Borodin-Kostochka's conjecture on \((P_5,C_4)\)-free graphs (Q2053188) (← links)
- Algorithmic aspects of upper paired-domination in graphs (Q2283034) (← links)
- Computing a minimum outer-connected dominating set for the class of chordal graphs (Q2444768) (← links)
- On the coalition number of trees (Q2699584) (← links)
- Cops and robber on subclasses of \(P_5\)-free graphs (Q2699919) (← links)
- Unique response Roman domination: complexity and algorithms (Q6088304) (← links)
- Singleton coalition graph chains (Q6125425) (← links)
- Strengthening Brooks' chromatic bound on \(P_6\)-free graphs (Q6143873) (← links)
- Towards the conjecture on domination versus edge domination in graphs (Q6186325) (← links)
- Cops and robber on subclasses of $P_5$-free graphs (Q6382764) (← links)
- On the coalition number of trees (Q6383270) (← links)
- List recoloring of planar graphs (Q6410599) (← links)