Pages that link to "Item:Q5957300"
From MaRDI portal
The following pages link to Domination in distance-hereditary graphs (Q5957300):
Displaying 8 items.
- A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs (Q938338) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- Laminar structure of ptolemaic graphs with applications (Q1028126) (← links)
- Simple linear-time algorithms for counting independent sets in distance-hereditary graphs (Q1706124) (← links)
- Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
- Fast and simple algorithms for counting dominating sets in distance-hereditary graphs (Q5012812) (← links)
- An efficient algorithm for distance total domination in block graphs (Q5963627) (← links)
