scientific article; zbMATH DE number 4204394
From MaRDI portal
Publication:3353058
Recommendations
- scientific article; zbMATH DE number 1735803
- Unsolved algorithmic problems on trees
- Dominating sets for split and bipartite graphs
- The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
- Domination numbers of planar graphs
- A dichotomy for upper domination in monogenic classes
- Total domination in block graphs
- Dominating cliques in graphs
- scientific article; zbMATH DE number 91051
- scientific article; zbMATH DE number 2147928
Cited in
(19)- On easy and hard hereditary classes of graphs with respect to the independent set problem
- Domination of cyclic monotone \((s,t)\)-graphs
- Solving problems on graphs of high rank-width
- Boundary classes of graphs for the dominating set problem
- NP-hard graph problems and boundary classes of graphs
- A boundary property for upper domination
- A dichotomy for upper domination in monogenic classes
- scientific article; zbMATH DE number 168429 (Why is no real title available?)
- A decidability result for the dominating set problem
- The complexity for the problems of covering of a graph with the minimum number of complete bipartite subgraphs
- scientific article; zbMATH DE number 4121429 (Why is no real title available?)
- Complexity of computing of the domination number in hereditary classes of graphs.
- scientific article; zbMATH DE number 7742925 (Why is no real title available?)
- Parameterized covering in semi-ladder-free hypergraphs
- Graph homomorphism, monotone classes and bounded pathwidth
- Upper domination: towards a dichotomy through boundary properties
- Satgraphs and independent domination. I
- Independent domination in hereditary classes
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3353058)
