Pages that link to "Item:Q2719843"
From MaRDI portal
The following pages link to Homogeneous sets and domination: A linear time algorithm for distance-hereditary graphs (Q2719843):
Displaying 10 items.
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360) (← links)
- Distance-hereditary digraphs (Q972365) (← links)
- Laminar structure of ptolemaic graphs with applications (Q1028126) (← links)
- Dominating sets reconfiguration under token sliding (Q2032965) (← links)
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
- A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs (Q4540045) (← links)
- Dominating cliques in distance-hereditary graphs (Q5054776) (← links)
- Domination problems on P<sub>5</sub>-free graphs (Q5248877) (← links)
- Domination in distance-hereditary graphs (Q5957300) (← links)
- Unique response Roman domination: complexity and algorithms (Q6088304) (← links)