The following pages link to (Q4407448):
Displaying 36 items.
- On the hyperbolicity of bipartite graphs and intersection graphs (Q317426) (← links)
- Split clique graph complexity (Q393107) (← links)
- Arboricity, \(h\)-index, and dynamic algorithms (Q418737) (← links)
- On the termination of some biclique operators on multipartite graphs (Q496448) (← links)
- On clique convergence of graphs (Q504155) (← links)
- Maximal independent sets in caterpillar graphs (Q765369) (← links)
- On self-clique graphs with triangular cliques (Q898089) (← links)
- The clique operator on circular-arc graphs (Q987670) (← links)
- The clique operator on matching and chessboard graphs (Q998495) (← links)
- On expansive graphs (Q1003586) (← links)
- The complexity of clique graph recognition (Q1019185) (← links)
- Cube intersection concepts in median graphs (Q1025912) (← links)
- The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
- The clique operator on cographs and serial graphs (Q1827743) (← links)
- A hierarchy of self-clique graphs (Q1827744) (← links)
- Dismantlings and iterated clique graphs (Q1827756) (← links)
- Cliques and extended triangles. A necessary condition for planar clique graphs (Q1827850) (← links)
- Clique divergent clockwork graphs and partial orders (Q1827862) (← links)
- Distances and diameters on iterated clique graphs (Q1827868) (← links)
- The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness (Q2007724) (← links)
- Biclique graphs of split graphs (Q2091808) (← links)
- On bicliques and the second clique graph of suspensions (Q2184693) (← links)
- On strong graph bundles (Q2404400) (← links)
- On cliques and bicliques (Q2413171) (← links)
- Discrete Morse theory and the homotopy type of clique graphs (Q2441385) (← links)
- The clique operator on graphs with few \(P_{4}\)'s (Q2489945) (← links)
- Termination of the iterated strong-factor operator on multipartite graphs (Q2512660) (← links)
- On balanced graphs (Q2583124) (← links)
- On the clique behavior of circulants with three small jumps (Q2840560) (← links)
- Split Clique Graph Complexity (Q3104760) (← links)
- On cliques of Helly Circular-arc Graphs (Q3503539) (← links)
- Random Graphs, Retractions and Clique Graphs (Q3503566) (← links)
- (Q5708502) (← links)
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs (Q5900085) (← links)
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs (Q5901067) (← links)
- Diclique digraphs (Q6180580) (← links)
