The clique operator on graphs with few P₄'s
From MaRDI portal
Publication:2489945
DOI10.1016/J.DAM.2005.09.002zbMATH Open1087.05045OpenAlexW2167782733MaRDI QIDQ2489945FDOQ2489945
Authors: Célia P. de Mello, Aurora Morgana, Marco Liverani
Publication date: 28 April 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.09.002
Recommendations
Cites Work
- Modular decomposition and transitive orientation
- Locally \(C_6\) graphs are clique divergent
- Über iterierte Clique-Graphen
- Title not available (Why is that?)
- Title not available (Why is that?)
- On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs
- On a unique tree representation for \(P_ 4\)-extendible graphs
- A tree representation for \(P_ 4\)-sparse graphs
- A New Class of Brittle Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Clique graphs and Helly graphs
- Title not available (Why is that?)
- A partial characterization of clique graphs
- Title not available (Why is that?)
- P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
- The clique operator on cographs and serial graphs
- Efficient algorithms for graphs with few \(P_4\)'s
- Convergence of iterated clique graphs
- On clique convergent graphs
- Title not available (Why is that?)
- Diameters of iterated clique graphs of chordal graphs
- Clique divergent graphs with unbounded sequence of diameters
- Dismantlings and iterated clique graphs
- Whitney triangulations, local girth and iterated clique graphs
- The icosahedron is clique divergent
- On clique divergent graphs with linear growth
Cited In (13)
- On the iterated edge-biclique operator
- On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets
- Title not available (Why is that?)
- Discrete Morse theory and the homotopy type of clique graphs
- On the clique behavior of circulants with three small jumps
- On expansive graphs
- Edge contraction and edge removal on iterated clique graphs
- Random Graphs, Retractions and Clique Graphs
- On the Iterated Biclique Operator
- Almost every graph is divergent under the biclique operator
- On strong graph bundles
- The clique operator on circular-arc graphs
- On the edge‐biclique graph and the iterated edge‐biclique operator
This page was built for publication: The clique operator on graphs with few \(P_{4}\)'s
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489945)