The icosahedron is clique divergent

DOI10.1016/S0012-365X(02)00502-2MaRDI QIDQ1868854zbMATH OpenOpenAlexFDO

Authors M. 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

icosahedronclique graphclique divergence

Mathematics Subject Classification ID

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

Recommendations

• On the clique behavior of graphs of low degree
• Graph relations, clique divergence and surface triangulations
• Clique divergent graphs with unbounded sequence of diameters
• Edge contraction and edge removal on iterated clique graphs
• On clique convergence of graphs

Cited in

(14)

• Clique divergent clockwork graphs and partial orders
• On the iterated biclique operator
• The clique operator on graphs with few \(P_{4}\)'s
• On the iterated edge-biclique operator
• The infinigon and its properties
• The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness
• The number of convergent graphs under the biclique operator with no twin vertices is finite
• Characterising clique convergence for locally cyclic graphs of minimum degree \(\delta \geq 6\)
• On expansive graphs
• Relaxations of the definition of regular clique assemblies
• Edge contraction and edge removal on iterated clique graphs
• Distances and diameters on iterated clique graphs
• Almost every graph is divergent under the biclique operator
• On the edge‐biclique graph and the iterated edge‐biclique operator

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1868854)