r-domination problems on homogeneously orderable graphs
From MaRDI portal
R-domination problems on homogeneously orderable graphs
Recommendations
- r-Domination problems on homogeneously orderable graphs
- Publication:4934237
- On domination elimination orderings and domination graphs
- scientific article; zbMATH DE number 5717271
- On the \(r\)-domination number of a graph
- Order-sensitive domination in partially ordered sets and graphs
- scientific article; zbMATH DE number 5844276
- \((k,r)\)-domination in graphs
- \(H\)-domination in graphs
- On domination problems for permutation and other graphs
Cited in
(9)- \(r\)-dominating cliques in graphs with hypertree structure
- A note on \(r\)-dominating cliques
- Homogeneous sets and domination: A linear time algorithm for distance-hereditary graphs
- scientific article; zbMATH DE number 5717271 (Why is no real title available?)
- scientific article; zbMATH DE number 1389817 (Why is no real title available?)
- r-Domination problems on homogeneously orderable graphs
- Collective Additive Tree Spanners of Homogeneously Orderable Graphs
- Homogeneous sets and domination problems
- On compact and efficient routing in certain graph classes
This page was built for publication: r-domination problems on homogeneously orderable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4361182)