The following pages link to Miguel A. Pizaña (Q324826):
Displaying 49 items.
- (Q266938) (redirect page) (← links)
- On self-clique shoal graphs (Q266940) (← links)
- On second iterated clique graphs that are also third iterated clique graphs (Q324827) (← links)
- On self-clique graphs with triangular cliques (Q898089) (← links)
- Equivariant collapses and the homotopy type of iterated clique graphs (Q932589) (← links)
- Contractibility and the clique graph operator (Q932670) (← links)
- The clique operator on matching and chessboard graphs (Q998495) (← links)
- On expansive graphs (Q1003586) (← 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)
- Clique divergent clockwork graphs and partial orders (Q1827862) (← links)
- Distances and diameters on iterated clique graphs (Q1827868) (← links)
- Whitney triangulations, local girth and iterated clique graphs (Q1850046) (← links)
- The icosahedron is clique divergent (Q1868854) (← links)
- Iterated clique graphs and bordered compact surfaces (Q1937563) (← links)
- Searching for square-complementary graphs: complexity of recognition and further nonexistence results (Q2022157) (← links)
- Two infinite families of critical clique-Helly graphs (Q2184660) (← links)
- On bicliques and the second clique graph of suspensions (Q2184693) (← links)
- On strong graph bundles (Q2404400) (← links)
- On cliques and bicliques (Q2413171) (← links)
- On the existence of critical clique-Helly graphs (Q2413178) (← links)
- On defensive alliances and strong global offensive alliances (Q2434727) (← links)
- Discrete Morse theory and the homotopy type of clique graphs (Q2441385) (← links)
- Edge contraction and edge removal on iterated clique graphs (Q2446322) (← links)
- Posets, clique graphs and their homotopy type (Q2462344) (← links)
- On hereditary clique-Helly self-clique graphs (Q2482111) (← links)
- The fundamental group of the clique graph (Q2519813) (← links)
- (Q2741452) (← links)
- (Q2741454) (← links)
- On the clique behavior of circulants with three small jumps (Q2840560) (← links)
- Graph relations, clique divergence and surface triangulations (Q3376693) (← links)
- (Q3439703) (← links)
- (Q3439704) (← links)
- Iterated Clique Graphs and Contractibility (Q3503563) (← links)
- Random Graphs, Retractions and Clique Graphs (Q3503566) (← links)
- (Q4430844) (← links)
- (Q4649996) (← links)
- (Q4810372) (← links)
- (Q4810373) (← links)
- (Q4982892) (← links)
- (Q5033132) (← links)
- (Q5206418) (← links)
- Clique‐convergence is undecidable for automatic graphs (Q6055401) (← links)
- Diclique digraphs (Q6180580) (← links)
- Simulating digital circuits with clique graphs (Q6492338) (← links)
- On 4-regular square-complementary graphs of large girth (Q6496795) (← links)
- Finding graphs with exponential clique-growth using genetic algorithms (Q6543675) (← links)
- Weighted Cages (Q6751985) (← links)
