Pages that link to "Item:Q1019185"
From MaRDI portal
The following pages link to The complexity of clique graph recognition (Q1019185):
Displaying 24 items.
- On second iterated clique graphs that are also third iterated clique graphs (Q324827) (← links)
- Split clique graph complexity (Q393107) (← links)
- The clique complex and hypergraph matching (Q873650) (← links)
- A polynomial algorithm for constructing the clique graph of a line graph (Q1075338) (← links)
- Recognizing clique graphs of directed and rooted path graphs (Q1293208) (← links)
- On clique-complete graphs (Q1382831) (← links)
- The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
- On edge-sets of bicliques in graphs (Q1759846) (← links)
- Vertex removal in biclique graphs (Q2091812) (← links)
- On the iterated edge-biclique operator (Q2132393) (← links)
- Intersection graph of maximal stars (Q2197473) (← links)
- Discrete Morse theory and the homotopy type of clique graphs (Q2441385) (← links)
- Edge contraction and edge removal on iterated clique graphs (Q2446322) (← links)
- Characterization of classical graph classes by weighted clique graphs (Q2448923) (← links)
- Clique-critical graphs: maximum size and recognition (Q2500528) (← links)
- On clique graphs with linear size (Q2717919) (← links)
- The clique operator, set families, and their properties (Q2741475) (← links)
- On the clique behavior of circulants with three small jumps (Q2840560) (← links)
- The difference between clique graphs and iterated clique graphs (Q2840680) (← links)
- On split clique graphs (Q2918477) (← links)
- The images of the clique operator and its square are different (Q2922215) (← links)
- Split Clique Graph Complexity (Q3104760) (← links)
- (Q5026980) (← links)
- On the edge‐biclique graph and the iterated edge‐biclique operator (Q6081559) (← links)
