On cliques of Helly Circular-arc Graphs

DOI10.1016/j.endm.2008.01.020zbMath1341.05196OpenAlexW1965463345MaRDI QIDQ3503539

Francisco J. Soulignac, Min Chih Lin, Jayme Luiz Szwarcfiter, Ross M. McConnell

Publication date: 5 June 2008

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2008.01.020

zbMATH Keywords

algorithmsclique graphsHelly circular-arc graphsproper Helly circular-arc graphsmaximum weight cliques

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

Efficient and perfect domination on circular-arc graphs ⋮ Essential obstacles to Helly circular-arc graphs ⋮ Weighted maximum-clique transversal sets of graphs ⋮ Proper Helly Circular-Arc Graphs ⋮ Normal Helly circular-arc graphs and its subclasses ⋮ The clique operator on circular-arc graphs ⋮ The complexity of clique graph recognition ⋮ Characterizations and recognition of circular-arc graphs and subclasses: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Characterizations and recognition of circular-arc graphs and subclasses: a survey
• An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs
• Efficient graph representations
• Algorithms for clique-independent sets on subclasses of circular-arc graphs
• A characterization of clique graphs
• Proper Helly Circular-Arc Graphs
• Clique Graph Recognition Is NP-Complete
• Graph Classes: A Survey
• A partial characterization of clique graphs

This page was built for publication: On cliques of Helly Circular-arc Graphs