Locally C₆ graphs are clique divergent
From MaRDI portal
Recommendations
Cited in
(25)- Locally grid graphs: Classification and Tutte uniqueness
- Clique divergent clockwork graphs and partial orders
- On the iterated biclique operator
- On self-clique shoal graphs
- The clique operator on graphs with few \(P_{4}\)'s
- On the iterated edge-biclique operator
- On the clique behavior of circulants with three small jumps
- On the clique behavior of graphs with small constant link.
- Characterising clique convergence for locally cyclic graphs of minimum degree \(\delta \geq 6\)
- The clique operator on cographs and serial graphs
- The clique operator on matching and chessboard graphs
- On expansive graphs
- The fundamental group of the clique graph
- Clique dynamics of locally cyclic graphs with \(\delta \geq 6\)
- On the clique behavior of graphs of low degree
- Equivariant collapses and the homotopy type of iterated clique graphs
- Distances and diameters on iterated clique graphs
- Iterated Clique Graphs and Contractibility
- The clique graphs of the hexagonal lattice -- an explicit construction and a short proof of divergence
- Distances and diameters on iterated clique graphs
- Almost every graph is divergent under the biclique operator
- A new family of expansive graphs
- On strong graph bundles
- Contractibility and the clique graph operator
- On the edge‐biclique graph and the iterated edge‐biclique operator
This page was built for publication: Locally \(C_6\) graphs are clique divergent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1974531)