The icosahedron is clique divergent

DOI10.1016/S0012-365X(02)00502-2zbMath1016.05056OpenAlexW1984482290MaRDI QIDQ1868854

Miguel A. Pizaña

Publication date: 28 April 2003

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00502-2

zbMATH Keywords

clique graphicosahedronclique divergence

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (11)

On the iterated edge-biclique operator ⋮ On the edge‐biclique graph and the iterated edge‐biclique operator ⋮ Almost every graph is divergent under the biclique operator ⋮ Edge contraction and edge removal on iterated clique graphs ⋮ On the Iterated Biclique Operator ⋮ The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness ⋮ The clique operator on graphs with few \(P_{4}\)'s ⋮ On expansive graphs ⋮ Clique divergent clockwork graphs and partial orders ⋮ Distances and diameters on iterated clique graphs ⋮ The number of convergent graphs under the biclique operator with no twin vertices is finite

This page was built for publication: The icosahedron is clique divergent