Characterising clique convergence for locally cyclic graphs of minimum degree 6
Characterising clique convergence for locally cyclic graphs of minimum degree \(\delta \geq 6\)
clique dynamicshexagonal latticeiterated clique graphslocally cyclic graphstriangular graph coverstriangulated surfaces
Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Relations of low-dimensional topology with graph theory (57M15)
- Clique divergent graphs with unbounded sequence of diameters
- Clique dynamics of locally cyclic graphs with \(\delta \geq 6\)
- Clique‐convergence is undecidable for automatic graphs
- Convergence of iterated clique graphs
- Covering complexes with applications to algebra
- Graph relations, clique divergence and surface triangulations
- scientific article; zbMATH DE number 2096441 (Why is no real title available?)
- Iterated clique graphs and bordered compact surfaces
- Locally \(C_6\) graphs are clique divergent
- On self-clique shoal graphs
- On strong graph bundles
- On the clique behavior of graphs of low degree
- The clique operator on circular-arc graphs
- The fundamental group of the clique graph
- The icosahedron is clique divergent
- Whitney triangulations, local girth and iterated clique graphs
- Über iterierte Clique-Graphen
This page was built for publication: Characterising clique convergence for locally cyclic graphs of minimum degree \(\delta \geq 6\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589121)
