Clique (graph theory)
Top View
- The Hidden Clique Problem and Graphical Models
- Characterizing Graph Classes by Intersections of Neighborhoods
- Clique Problem Is NP-Complete
- From Tree-Decompositions to Clique-Width Terms Bruno Courcelle
- The Parameterized Complexity of Editing Graphs for Bounded
- Structural Parameterizations for Boxicity
- New Graph Classes of Bounded Clique Width
- An Algorithm to Discover the K-Clique Cover in Networks
- The Maximum Clique Problems with Applications to Graph Coloring Qinghua Wu
- Complexity of Generalized Colourings of Chordal Graphs
- An Output Sensitive Algorithm for Maximal Clique Enumeration in Sparse Graphs
- The Subchromatic Index of Graphs
- CYCLEWIDTH: an ANALOGY of TREEWIDTH 1 Introduction
- Graphs, Their Width, and Logic
- Stacked Treewidth and the Colin De Verdière Number
- The Graph Parameter Hierarchy
- Cliques and Intersection Graphs for Intervals
- Clique, Vertex Cover, and Independent Set Clique