The clique graphs of the hexagonal lattice -- an explicit construction and a short proof of divergence

DOI10.1016/j.disc.2024.113912arXiv2307.11238OpenAlexW4391503745WikidataQ128735073 ScholiaQ128735073MaRDI QIDQ6204329

Martin Winter

Publication date: 27 March 2024

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

Full work available at URL: https://arxiv.org/abs/2307.11238

zbMATH Keywords

clique graphslattice graphshexagonal latticeclique divergenceclique convergenceclique dynamics

Mathematics Subject Classification ID

Relations of low-dimensional topology with graph theory (57M15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Clique divergent graphs with unbounded sequence of diameters
• Locally \(C_6\) graphs are clique divergent
• Clique dynamics of locally cyclic graphs with \(\delta \geq 6\)

This page was built for publication: The clique graphs of the hexagonal lattice -- an explicit construction and a short proof of divergence