On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
DOI10.1016/J.ENDM.2008.01.026zbMATH Open1341.05161OpenAlexW2176294644MaRDI QIDQ5900085FDOQ5900085
Authors: L. Alcón, Luerbio Faria, Celina M. H. de Figueiredo, M. Gutierrez 
Publication date: 5 June 2008
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: http://sedici.unlp.edu.ar/handle/10915/82445
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Topics in Intersection Graph Theory
- Optimization, approximation, and complexity classes
- Some APX-completeness results for cubic graphs
- Graph Classes: A Survey
- The node-deletion problem for hereditary properties is NP-complete
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The approximation of maximum subgraph problems
- Clique Graph Recognition Is NP-Complete
Cited In (2)
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 Q5900085)
