Pages that link to "Item:Q1962038"
From MaRDI portal
The following pages link to Domination and total domination on asteroidal triple-free graphs (Q1962038):
Displaying 18 items.
- A complexity dichotomy and a new boundary class for the dominating set problem (Q328713) (← links)
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs (Q477326) (← links)
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360) (← links)
- On conditional covering problem (Q626967) (← links)
- Semitotal domination on AT-free graphs and circle graphs (Q831692) (← links)
- Matching properties in total domination vertex critical graphs (Q968225) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- Efficient algorithms for Roman domination on some classes of graphs (Q1003729) (← links)
- Algorithms for graphs with small octopus (Q1421464) (← links)
- On claw-free asteroidal triple-free graphs (Q1613398) (← links)
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
- Induced disjoint paths in AT-free graphs (Q2051862) (← links)
- Complexity of paired domination in AT-free and planar graphs (Q2166758) (← links)
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
- On the minimum eccentricity shortest path problem (Q2404081) (← links)
- On the Minimum Eccentricity Shortest Path Problem (Q3449826) (← links)
- Independent sets in asteroidal triple-free graphs (Q4572004) (← links)
- Domination problems on P<sub>5</sub>-free graphs (Q5248877) (← links)
