Whitney triangulations, local girth and iterated clique graphs

DOI10.1016/S0012-365X(02)00266-2MaRDI QIDQ1850046zbMATH OpenWikidataFDO

Authors F. Larrión, V. Neumann-Lara, M. A. Pizaña

Publication date 2 December 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(02)00266-2

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Review text

The authors study the dynamical behaviour of surface triangulations under the iterated application of the clique graph operator \(k\), which transforms a graph \(H\) into the intersection graph \(kH\) of its maximal cliques. A graph \(G\) is \(k\)-divergent if the sequence of the orders \(|V(k^n G)|\) tends to infinity with \(n\). Otherwise, \(G\) is \(k\)-bounded. It is assumed that every triangle of \(G\) is a face of the triangulation and it is proved that every such \(d\)-regular triangulation is \(k\)-bounded for \(d\geq 7\).

Recommendations

• Iterated clique graphs and bordered compact surfaces
• Graph relations, clique divergence and surface triangulations
• Clique dynamics of locally cyclic graphs with \(\delta \geq 6\)
• On the clique behavior of graphs of low degree
• Edge contraction and edge removal on iterated clique graphs

Cited in

(25)

• On expansive graphs
• An extension of Whitney's theorem to infinite strong triangulations
• Clique divergent clockwork graphs and partial orders
• Iterated clique graphs and bordered compact surfaces
• On second order degree of graphs
• On the iterated edge-biclique operator
• Clique dynamics of locally cyclic graphs with \(\delta \geq 6\)
• On the clique behavior of graphs of low degree
• Two infinite families of critical clique-Helly graphs
• On the existence of critical clique-Helly graphs
• Discrete Morse theory and the homotopy type of clique graphs
• Posets, clique graphs and their homotopy type
• The clique operator on graphs with few \(P_{4}\)'s
• The fundamental group of the clique graph
• The number of convergent graphs under the biclique operator with no twin vertices is finite
• Iterated Clique Graphs and Contractibility
• scientific article; zbMATH DE number 2096441 (Why is no real title available?)
• On the iterated biclique operator
• D-Levels locally homogeneous graphs
• On the edge‐biclique graph and the iterated edge‐biclique operator
• Characterising clique convergence for locally cyclic graphs of minimum degree \(\delta \geq 6\)
• Sparse vertex cutsets and the maximum degree
• Almost every graph is divergent under the biclique operator
• Contractibility and the clique graph operator
• The clique operator on matching and chessboard graphs

This page was built for publication: Whitney triangulations, local girth and iterated clique graphs

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