The clique operator on circular-arc graphs
From MaRDI portal
Publication:987670
DOI10.1016/J.DAM.2009.01.019zbMATH Open1209.05246OpenAlexW2060969780MaRDI QIDQ987670FDOQ987670
Authors: Min Chih Lin, Francisco J. Soulignac, Jayme L. Szwarcfiter 
Publication date: 13 August 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.01.019
Recommendations
Cites Work
- Graph Classes: A Survey
- Efficient graph representations
- Linear-time recognition of circular-arc graphs
- Vertex-to-vertex pursuit in a graph
- Self-clique Helly circular-arc graphs
- Über iterierte Clique-Graphen
- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- Title not available (Why is that?)
- Stability in circular arc graphs
- Title not available (Why is that?)
- A partial characterization of clique graphs
- Clique graphs of time graphs
- Algorithms for clique-independent sets on subclasses of circular-arc graphs
- A characterization of clique graphs
- On cliques of Helly Circular-arc Graphs
- Title not available (Why is that?)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Unit Circular-Arc Graph Representations and Feasible Circulations
- Recognizing quasi-triangulated graphs.
- The clique operator on cographs and serial graphs
- Clique Graph Recognition Is NP-Complete
- A Simpler Linear-Time Recognition of Circular-Arc Graphs
- Proper Helly Circular-Arc Graphs
- Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs
- Convergence of iterated clique graphs
- On expansive graphs
- A family of clique divergent graphs with linear growth
- Dismantlings and iterated clique graphs
- The clique operator on graphs with few \(P_{4}\)'s
- Title not available (Why is that?)
Cited In (18)
- Split clique graph complexity
- Title not available (Why is that?)
- Boxicity of circular arc graphs
- On cliques of Helly Circular-arc Graphs
- Termination of the iterated strong-factor operator on multipartite graphs
- Characterising clique convergence for locally cyclic graphs of minimum degree \(\delta \geq 6\)
- On the clique behavior of graphs of low degree
- Completing colored graphs to meet a target property
- Intersection graphs and the clique operator
- Essential obstacles to Helly circular-arc graphs
- Self-clique Helly circular-arc graphs
- Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection
- On the termination of some biclique operators on multipartite graphs
- On strong graph bundles
- Biclique graphs of split graphs
- Restricted circular-arc graphs and clique cycles
- Biclique graphs of interval bigraphs
- Normal Helly circular-arc graphs and its subclasses
This page was built for publication: The clique operator on circular-arc graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987670)
