Split Clique Graph Complexity
DOI10.1007/978-3-642-25870-1_3zbMath1341.05183OpenAlexW1819739797MaRDI QIDQ3104760
Marisa Gutierrez, Liliana Alcón, Luérbio Faria, Celina M. Herrera de Figueiredo
Publication date: 16 December 2011
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: http://sedici.unlp.edu.ar/handle/10915/84984
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of clique graph recognition
- Cliques and extended triangles. A necessary condition for planar clique graphs
- A characterization of clique graphs
- Clique Graph Recognition Is NP-Complete
- Small weight codewords in the LDPC codes arising from linear representations of geometries
- Dually Chordal Graphs
- Topics in Intersection Graph Theory
- Graph Classes: A Survey
- Clique Graphs of Chordal and Path Graphs
- A partial characterization of clique graphs
This page was built for publication: Split Clique Graph Complexity
