Dismantlings and iterated clique graphs
From MaRDI portal
Publication:1827756
DOI10.1016/J.DISC.2003.12.011zbMATH Open1042.05070OpenAlexW2151988305MaRDI QIDQ1827756FDOQ1827756
Authors: Martín Eduardo Frías-Armenta, V. Neumann-Lara, M. A. Pizaña 
Publication date: 6 August 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2003.12.011
Recommendations
Cites Work
- Über iterierte Clique-Graphen
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convergence of iterated clique graphs
- Clique divergent clockwork graphs and partial orders
- A family of clique divergent graphs with linear growth
- On clique divergent graphs with linear growth
- Title not available (Why is that?)
- Clique divergent clockwork graphs and partial orders
Cited In (17)
- On the iterated biclique operator
- The clique operator on graphs with few \(P_{4}\)'s
- On the iterated edge-biclique operator
- Posets, clique graphs and their homotopy type
- On the clique behavior of circulants with three small jumps
- The number of convergent graphs under the biclique operator with no twin vertices is finite
- Edge contraction and edge removal on iterated clique graphs
- Equivariant collapses and the homotopy type of iterated clique graphs
- Iterated Clique Graphs and Contractibility
- The complexity of clique graph recognition
- Minimal graphs for contractible and dismantlable properties
- Almost every graph is divergent under the biclique operator
- The clique operator on circular-arc graphs
- On the edge‐biclique graph and the iterated edge‐biclique operator
- Contractibility and the clique graph operator
- Intersection graph of maximal stars
- Convergence of iterated clique graphs
Uses Software
This page was built for publication: Dismantlings and iterated clique graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827756)
