Whitney triangulations, local girth and iterated clique graphs
From MaRDI portal
Publication:1850046
DOI10.1016/S0012-365X(02)00266-2zbMATH Open1010.05050WikidataQ56504289 ScholiaQ56504289MaRDI QIDQ1850046FDOQ1850046
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)
Recommendations
Cited In (24)
- On the iterated biclique operator
- Clique divergent clockwork graphs and partial orders
- The clique operator on graphs with few \(P_{4}\)'s
- On the iterated edge-biclique operator
- Discrete Morse theory and the homotopy type of clique graphs
- Posets, clique graphs and their homotopy type
- Characterising clique convergence for locally cyclic graphs of minimum degree \(\delta \geq 6\)
- The number of convergent graphs under the biclique operator with no twin vertices is finite
- The clique operator on matching and chessboard graphs
- On expansive graphs
- The fundamental group of the clique graph
- 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
- Iterated Clique Graphs and Contractibility
- D-Levels locally homogeneous graphs
- Iterated clique graphs and bordered compact surfaces
- On second order degree of graphs
- Almost every graph is divergent under the biclique operator
- Title not available (Why is that?)
- An extension of Whitney's theorem to infinite strong triangulations
- On the edge‐biclique graph and the iterated edge‐biclique operator
- On the existence of critical clique-Helly graphs
- Contractibility and the clique graph operator
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)
