Pages that link to "Item:Q2570105"
From MaRDI portal
The following pages link to Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets (Q2570105):
Displaying 8 items.
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- Coupon-coloring and total domination in Hamiltonian planar triangulations (Q1756106) (← links)
- Disjoint dominating and 2-dominating sets in graphs (Q2299982) (← links)
- Algorithm and complexity of the two disjoint connected dominating sets problem on trees (Q2335669) (← links)
- Minimal graphs with disjoint dominating and paired-dominating sets (Q2656336) (← links)
- Restrained and Total Restrained Domination in Graphs (Q3384608) (← links)
- Some results for the two disjoint connected dominating sets problem (Q5207499) (← links)
- Partitioning the Vertices of a Graph into Two Total Dominating Sets (Q5236035) (← links)
