Domination problems with no conflicts
From MaRDI portal
Recommendations
Cites work
- A simplified NP-complete satisfiability problem
- An exact algorithm to check the existence of (elementary) paths and a generalisation of the cut problem in graphs with forbidden transitions
- Complexity of the path avoiding forbidden pairs problem revisited
- Finding paths in grids with forbidden transitions
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Nash-Williams-type and Chvátal-type conditions in one-conflict graphs
- On paths avoding forbidden pairs of vertices in a graph
- On the complexity of paths avoiding forbidden pairs
- Some Hamiltonian properties of one-conflict graphs
- Total domination, connected vertex cover and Steiner tree with conflicts
- Trees in graphs with conflict edges or forbidden transitions
Cited in
(4)
This page was built for publication: Domination problems with no conflicts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752590)