Reducing graph transversals via edge contractions
From MaRDI portal
Publication:5089236
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 7561685 (Why is no real title available?)
- scientific article; zbMATH DE number 7650254 (Why is no real title available?)
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
- Blockers for the stability number and the chromatic number
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs
- Critical vertices and edges in \(H\)-free graphs
- Easy problems for tree-decomposable graphs
- Fundamentals of parameterized complexity
- Graph minors. V. Excluding a planar graph
- Hadwiger's conjecture is true for almost every graph
- Hitting forbidden subgraphs in graphs of bounded treewidth
- Intersection of longest paths in graph classes
- Lossy kernels for graph contraction problems
- Minimum \(d\)-blockers and \(d\)-transversals in graphs
- Minimum vertex blocker clique problem
- Node-and edge-deletion NP-complete problems
- Nonempty intersection of longest paths in series-parallel graphs
- Obtaining a bipartite graph by contracting few edges
- On the NP-hardness of edge-deletion and -contraction problems
- On the complexity of \(k\)-SAT
- Parameterized algorithms
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The most vital nodes with respect to independent set and vertex cover
- The node-deletion problem for hereditary properties is NP-complete
- Transversals of Longest Paths and Cycles
- Which problems have strongly exponential complexity?
Cited in
(2)
This page was built for publication: Reducing graph transversals via edge contractions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089236)
