The complexity of clique graph recognition
From MaRDI portal
Redirect page
Redirect to:
Recommendations
Cites work
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 1189244 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1286517 (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 3993639 (Why is no real title available?)
- scientific article; zbMATH DE number 2096431 (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?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- scientific article; zbMATH DE number 2230216 (Why is no real title available?)
- A characterization of clique graphs
- A common generalization of line graphs and clique graphs
- A partial characterization of clique graphs
- Clique Graph Recognition Is NP-Complete
- Clique Graphs of Chordal and Path Graphs
- Clique-critical graphs: maximum size and recognition
- Clique-inverse graphs ofK3-free andK4-free graphs
- Cliques and extended triangles. A necessary condition for planar clique graphs
- Convergence of iterated clique graphs
- Dismantlings and iterated clique graphs
- Distances and diameters on iterated clique graphs
- Dually Chordal Graphs
- Graph Classes: A Survey
- Graph relations, clique divergence and surface triangulations
- Intersection graphs and the clique operator
- On clique convergent graphs
- On clique divergent graphs with linear growth
- On clique-complete graphs
- On clique-critical graphs
- On cliques of Helly Circular-arc Graphs
- On hereditary clique-Helly self-clique graphs
- Recognizing clique graphs of directed and rooted path graphs
- Self‐clique graphs and matrix permutations
- The clique operator on cographs and serial graphs
- Topics in Intersection Graph Theory
- Über iterierte Clique-Graphen
Cited in
(25)- Split clique graph complexity
- On split clique graphs
- The images of the clique operator and its square are different
- On the iterated edge-biclique operator
- The clique operator, set families, and their properties
- Characterization of classical graph classes by weighted clique graphs
- scientific article; zbMATH DE number 2188421 (Why is no real title available?)
- Discrete Morse theory and the homotopy type of clique graphs
- On the clique behavior of circulants with three small jumps
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- On edge-sets of bicliques in graphs
- Edge contraction and edge removal on iterated clique graphs
- On second iterated clique graphs that are also third iterated clique graphs
- Recognizing clique graphs of directed and rooted path graphs
- Clique Graph Recognition Is NP-Complete
- Split clique graph complexity
- The difference between clique graphs and iterated clique graphs
- On clique graphs with linear size
- The clique complex and hypergraph matching
- Clique-critical graphs: maximum size and recognition
- On the edge‐biclique graph and the iterated edge‐biclique operator
- Intersection graph of maximal stars
- A polynomial algorithm for constructing the clique graph of a line graph
- Structural properties of biclique graphs and the distance formula
- Vertex removal in biclique graphs
This page was built for publication: The complexity of clique graph recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1019185)
