Pages that link to "Item:Q5054776"
From MaRDI portal
The following pages link to Dominating cliques in distance-hereditary graphs (Q5054776):
Displaying 20 items.
- A note on connected dominating sets of distance-hereditary graphs (Q423975) (← links)
- Eccentricity function in distance-hereditary graphs (Q784475) (← links)
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q832869) (← links)
- Networks with small stretch number (Q876723) (← links)
- Weighted efficient domination problem on some perfect graphs (Q1348388) (← links)
- A note on \(r\)-dominating cliques (Q1382816) (← links)
- Homogeneously orderable graphs (Q1392023) (← links)
- Finding a central vertex in an HHD-free graph (Q1408816) (← links)
- LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem (Q1962066) (← links)
- Equistable distance-hereditary graphs (Q2473043) (← links)
- The Hamiltonian problem on distance-hereditary graphs (Q2489947) (← links)
- Helly-gap of a graph and vertex eccentricities (Q2663046) (← links)
- r-Domination problems on homogeneously orderable graphs (Q5055891) (← links)
- Graphs with bounded induced distance (Q5928866) (← links)
- Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs (Q5941496) (← links)
- Diameter determination on restricted graph families (Q5951960) (← links)
- Domination in distance-hereditary graphs (Q5957300) (← links)
- LexBFS-orderings and powers of graphs (Q6550543) (← links)
- \( \alpha_i\)-metric graphs: radius, diameter and all eccentricities (Q6582369) (← links)
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q6671670) (← links)
