The clique operator on circular-arc graphs

DOI10.1016/j.dam.2009.01.019zbMath1209.05246OpenAlexW2060969780MaRDI QIDQ987670

Min Chih Lin, Francisco J. Soulignac, Jayme Luiz 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

zbMATH Keywords

algorithmsclique graphsHelly circular-arc graphs\(K\)-behaviorproper Helly circular-arc graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (12)

On the clique behavior of graphs of low degree ⋮ Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection ⋮ Essential obstacles to Helly circular-arc graphs ⋮ On strong graph bundles ⋮ Split clique graph complexity ⋮ Biclique graphs of interval bigraphs ⋮ Normal Helly circular-arc graphs and its subclasses ⋮ Boxicity of circular arc graphs ⋮ On the termination of some biclique operators on multipartite graphs ⋮ Completing colored graphs to meet a target property ⋮ Termination of the iterated strong-factor operator on multipartite graphs ⋮ Biclique graphs of split graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clique graphs of time graphs
• On expansive graphs
• Characterizations and recognition of circular-arc graphs and subclasses: a survey
• Convergence of iterated clique graphs
• A family of clique divergent graphs with linear growth
• Efficient graph representations
• Linear-time recognition of circular-arc graphs
• Recognizing quasi-triangulated graphs.
• The clique operator on cographs and serial graphs
• Dismantlings and iterated clique graphs
• Vertex-to-vertex pursuit in a graph
• Self-clique Helly circular-arc graphs
• The clique operator on graphs with few \(P_{4}\)'s
• Algorithms for clique-independent sets on subclasses of circular-arc graphs
• A characterization of clique graphs
• Über iterierte Clique-Graphen
• On cliques of Helly Circular-arc Graphs
• Proper Helly Circular-Arc Graphs
• A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs
• Clique Graph Recognition Is NP-Complete
• Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs
• Unit Circular-Arc Graph Representations and Feasible Circulations
• Stability in circular arc graphs
• Graph Classes: A Survey
• Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
• A partial characterization of clique graphs
• A Simpler Linear-Time Recognition of Circular-Arc Graphs

This page was built for publication: The clique operator on circular-arc graphs