Split clique graph complexity
DOI10.1016/J.TCS.2013.07.020zbMATH Open1416.68127OpenAlexW2040819829MaRDI QIDQ393107FDOQ393107
Authors: L. Alcón, M. Gutierrez, Luerbio Faria, Celina M. H. de Figueiredo 
Publication date: 16 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.07.020
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) 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
- Topics in Intersection Graph Theory
- Graph Classes: A Survey
- Title not available (Why is that?)
- Self‐clique graphs and matrix permutations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dually Chordal Graphs
- Recognizing clique graphs of directed and rooted path graphs
- Title not available (Why is that?)
- Complexity aspects of the Helly property: graphs and hypergraphs
- Title not available (Why is that?)
- A partial characterization of clique graphs
- The complexity of clique graph recognition
- A characterization of clique graphs
- The clique operator on circular-arc graphs
- On clique-complete graphs
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- The clique operator on cographs and serial graphs
- Cliques and extended triangles. A necessary condition for planar clique graphs
- Graph relations, clique divergence and surface triangulations
- Clique Graph Recognition Is NP-Complete
- Clique Graphs of Chordal and Path Graphs
- Clique-inverse graphs ofK3-free andK4-free graphs
Cited In (5)
This page was built for publication: Split clique graph complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393107)
