Restrained domination in some subclasses of chordal graphs
From MaRDI portal
(Redirected from Publication:2413358)
Recommendations
- A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs
- Restrained domination in graphs
- NP-completeness and APX-completeness of restrained domination in graphs
- On total restrained domination in graphs
- Semipaired Domination in Some Subclasses of Chordal Graphs
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Dually Chordal Graphs
- Restrained domination in graphs
Cited in
(7)- Exact square coloring of certain classes of graphs: complexity and algorithms
- Weighted restrained domination in subclasses of planar graphs
- A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs
- scientific article; zbMATH DE number 48751 (Why is no real title available?)
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- Semipaired Domination in Some Subclasses of Chordal Graphs
- Restrained domination and its variants in extended supergrid graphs
This page was built for publication: Restrained domination in some subclasses of chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413358)