Algorithmic aspects of \P_k\-isolation in graphs and extremal graphs for a \P₃\-isolation bound
From MaRDI portal
Publication:6602332
Recommendations
Cites work
- \( K_{1 , 2}\)-isolation in graphs
- A survey of selected recent results on total domination in graphs
- Dominating Sets in Chordal Graphs
- Extensions of the Art Gallery Theorem
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Independent domination in graphs: A survey and recent results
- Isolation number of maximal outerplanar graphs
- Isolation of \(k\)-cliques
- Isolation of connected graphs
- Isolation of cycles
- Partial domination -- the isolation number of a graph
- Partial domination of maximal outerplanar graphs
Cited in
(4)
This page was built for publication: Algorithmic aspects of \(\{P_k\}\)-isolation in graphs and extremal graphs for a \(\{P_3\}\)-isolation bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6602332)