Pages that link to "Item:Q968212"
From MaRDI portal
The following pages link to Restrained domination in claw-free graphs with minimum degree at least two (Q968212):
Displaying 8 items.
- Total restrained domination in claw-free graphs with minimum degree at least two (Q411852) (← links)
- NP-completeness and APX-completeness of restrained domination in graphs (Q442103) (← links)
- Restrained domination in cubic graphs (Q719025) (← links)
- An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree (Q967326) (← links)
- Total restrained domination in claw-free graphs (Q2268763) (← links)
- Restrained and Total Restrained Domination in Graphs (Q3384608) (← links)
- A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs (Q5261054) (← links)
- Claw-free graphs with equal 2-domination and domination numbers (Q5279559) (← links)