The clique operator on cographs and serial graphs
From MaRDI portal
Publication:1827743
DOI10.1016/J.DISC.2003.10.023zbMATH Open1042.05074OpenAlexW2050020552MaRDI QIDQ1827743FDOQ1827743
Authors: F. Larrión, Célia P. de Mello, Aurora Morgana, 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.10.023
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?)
- Dually Chordal Graphs
- Title not available (Why is that?)
- A Linear Recognition Algorithm for Cographs
- 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
- Clique graphs of time graphs
- On a class of posets and the corresponding comparability graphs
- On clique-complete graphs
- Clique Graphs of Chordal and Path Graphs
- Dacey Graphs
- Title not available (Why is that?)
- Efficient algorithms for graphs with few \(P_4\)'s
- Convergence of iterated clique graphs
- On clique convergent graphs
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs
- Diameters of iterated clique graphs of chordal graphs
- On Graphs Without Multicliqual Edges
- Metric characterizations of proper interval graphs and tree-clique graphs
- Clique divergent graphs with unbounded sequence of diameters
- A family of clique divergent graphs with linear growth
Cited In (21)
- Split clique graph complexity
- On the iterated biclique operator
- On the clique behavior and Hellyness of the complements of regular graphs
- The clique operator on graphs with few \(P_{4}\)'s
- On the iterated edge-biclique operator
- Title not available (Why is that?)
- Termination of the iterated strong-factor operator on multipartite graphs
- 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
- The clique operator on matching and chessboard graphs
- On the clique behavior of graphs of low degree
- Some properties of the clique graph of a cograph
- Linear-time algorithm for the matched-domination problem in cographs
- The complexity of clique graph recognition
- Almost every graph is divergent under the biclique operator
- On the termination of some biclique operators on multipartite graphs
- Clique‐convergence is undecidable for automatic graphs
- The clique operator on circular-arc graphs
- On clique convergence of graphs
- On the edge‐biclique graph and the iterated edge‐biclique operator
- The clique behavior of circulants with three small jumps.
This page was built for publication: The clique operator on cographs and serial graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827743)
