The following pages link to Sukanya Pandey (Q831824):
Displayed 8 items.
- Parameterizing role coloring on forests (Q831825) (← links)
- Role coloring bipartite graphs (Q2081494) (← links)
- Complexity Framework For Forbidden Subgraphs I: The Framework (Q6418235) (← links)
- Complexity Framework for Forbidden Subgraphs II: When Hardness Is Not Preserved under Edge Subdivision (Q6418480) (← links)
- Treewidth is NP-Complete on Cubic Graphs (and related results) (Q6424266) (← links)
- Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs (Q6434976) (← links)
- Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem (Q6435083) (← links)
- Computing Subset Vertex Covers in $H$-Free Graphs (Q6443388) (← links)