The clique operator on cographs and serial graphs
From MaRDI portal
Publication:1827743
DOI10.1016/j.disc.2003.10.023zbMath1042.05074OpenAlexW2050020552MaRDI QIDQ1827743
F. Larrión, Miguel A. Pizaña, Célia Picinin de Mello, Aurora Morgana, Víctor Neumann-Lara
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
Related Items (16)
On the iterated edge-biclique operator ⋮ On the clique behavior of graphs of low degree ⋮ Split clique graph complexity ⋮ On the edge‐biclique graph and the iterated edge‐biclique operator ⋮ Almost every graph is divergent under the biclique operator ⋮ On the termination of some biclique operators on multipartite graphs ⋮ On the Iterated Biclique Operator ⋮ The clique operator on graphs with few \(P_{4}\)'s ⋮ The clique operator on circular-arc graphs ⋮ The clique operator on matching and chessboard graphs ⋮ Termination of the iterated strong-factor operator on multipartite graphs ⋮ The complexity of clique graph recognition ⋮ Linear-time algorithm for the matched-domination problem in cographs ⋮ The number of convergent graphs under the biclique operator with no twin vertices is finite ⋮ On the clique behavior of circulants with three small jumps ⋮ On the clique behavior and Hellyness of the complements of regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clique graphs of time graphs
- Clique graphs and Helly graphs
- Convergence of iterated clique graphs
- On a class of posets and the corresponding comparability graphs
- Clique divergent graphs with unbounded sequence of diameters
- Modular decomposition and transitive orientation
- A family of clique divergent graphs with linear growth
- On clique-complete graphs
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs
- On clique convergent graphs
- Locally \(C_6\) graphs are clique divergent
- Über iterierte Clique-Graphen
- Diameters of iterated clique graphs of chordal graphs
- A Linear Recognition Algorithm for Cographs
- On Graphs Without Multicliqual Edges
- Dacey Graphs
- Dually Chordal Graphs
- Clique Graphs of Chordal and Path Graphs
- Metric characterizations of proper interval graphs and tree-clique graphs
- A partial characterization of clique graphs
- Efficient algorithms for graphs with few \(P_4\)'s
This page was built for publication: The clique operator on cographs and serial graphs
