On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
From MaRDI portal
(Redirected from Publication:5901067)
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs (scientific article; zbMATH DE number 5770503)
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs (scientific article; zbMATH DE number 5770503)
Recommendations
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
- Faster recognition of clique-Helly and hereditary clique-Helly graphs
- scientific article; zbMATH DE number 1409177
- On the hereditary (p,q)-Helly property of hypergraphs, cliques, and bicliques
- scientific article; zbMATH DE number 553916
Cites work
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 1256636 (Why is no real title available?)
- scientific article; zbMATH DE number 553916 (Why is no real title available?)
- scientific article; zbMATH DE number 1944140 (Why is no real title available?)
- scientific article; zbMATH DE number 851097 (Why is no real title available?)
- scientific article; zbMATH DE number 1409177 (Why is no real title available?)
- Clique Graph Recognition Is NP-Complete
- Graph Classes: A Survey
- Optimization, approximation, and complexity classes
- Some APX-completeness results for cubic graphs
- The approximation of maximum subgraph problems
- The node-deletion problem for hereditary properties is NP-complete
- Topics in Intersection Graph Theory
Cited in
(3)
This page was built for publication: On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5901067)