Characterising clique convergence for locally cyclic graphs of minimum degree \(\delta \geq 6\)

DOI10.1016/j.disc.2024.114144zbMath1545.05184MaRDI QIDQ6589121

Martin Winter, Anna M. Limbach

Publication date: 19 August 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

triangulated surfaceshexagonal latticeclique dynamicsiterated clique graphslocally cyclic graphstriangular graph covers

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Relations of low-dimensional topology with graph theory (57M15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• On self-clique shoal graphs
• The clique operator on circular-arc graphs
• Convergence of iterated clique graphs
• Clique divergent graphs with unbounded sequence of diameters
• Whitney triangulations, local girth and iterated clique graphs
• The icosahedron is clique divergent
• Iterated clique graphs and bordered compact surfaces
• Locally \(C_6\) graphs are clique divergent
• Clique dynamics of locally cyclic graphs with \(\delta \geq 6\)
• On the clique behavior of graphs of low degree
• Covering complexes with applications to algebra
• On strong graph bundles
• The fundamental group of the clique graph
• Über iterierte Clique-Graphen
• Graph relations, clique divergence and surface triangulations
• Clique‐convergence is undecidable for automatic graphs

This page was built for publication: Characterising clique convergence for locally cyclic graphs of minimum degree \(\delta \geq 6\)