Pages that link to "Item:Q1025505"
From MaRDI portal
The following pages link to Complete description of forbidden subgraphs in the structural domination problem (Q1025505):
Displaying 14 items.
- On graphs for which the connected domination number is at most the total domination number (Q423952) (← links)
- A note on connected dominating sets of distance-hereditary graphs (Q423975) (← links)
- Distance domination versus iterated domination (Q442389) (← links)
- On the existence of total dominating subgraphs with a prescribed additive hereditary property (Q641172) (← links)
- Transversals and domination in uniform hypergraphs (Q649007) (← links)
- On maximum independent sets in \(P_{5}\)-free graphs (Q708334) (← links)
- Infinite versus finite graph domination (Q968422) (← links)
- Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time (Q1693130) (← links)
- The complexity of connected dominating sets and total dominating sets with specified induced subgraphs (Q1941700) (← links)
- Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs (Q2222949) (← links)
- Domination, coloring and stability in \(P_5\)-reducible graphs (Q2341757) (← links)
- On connected dominating sets of restricted diameter (Q2356248) (← links)
- On dominating sets whose induced subgraphs have a bounded diameter (Q2444556) (← links)
- Connected Domination (Q3384607) (← links)
