On cliques of Helly Circular-arc Graphs

DOI10.1016/J.ENDM.2008.01.020MaRDI QIDQ3503539zbMATH OpenOpenAlexFDO

Authors Min Chih Lin, Francisco J. Soulignac, R. M. McConnell, Jayme L. Szwarcfiter

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 graphsmaximum weight cliquesproper Helly circular-arc graphs

Mathematics Subject Classification ID

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

Recommendations

• Linear-time recognition of Helly circular-arc models and graphs
• The clique operator on circular-arc graphs
• Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
• scientific article; zbMATH DE number 2188345
• Proper Helly Circular-Arc Graphs

Cites work

• A characterization of clique graphs
• A partial characterization of clique graphs
• Algorithms for clique-independent sets on subclasses of circular-arc graphs
• An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs
• Characterizations and recognition of circular-arc graphs and subclasses: a survey
• Clique Graph Recognition Is NP-Complete
• Efficient graph representations
• Graph Classes: A Survey
• scientific article; zbMATH DE number 1944140 (Why is no real title available?)
• scientific article; zbMATH DE number 2188345 (Why is no real title available?)
• Proper Helly Circular-Arc Graphs

Cited in

(14)

• The complexity of clique graph recognition
• Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
• Characterizations and recognition of circular-arc graphs and subclasses: a survey
• Normal Helly circular-arc graphs and its subclasses
• Essential obstacles to Helly circular-arc graphs
• A note on the Hadwiger number of circular arc graphs
• Self-clique Helly circular-arc graphs
• Algorithms for clique-independent sets on subclasses of circular-arc graphs
• Efficient and perfect domination on circular-arc graphs
• Proper Helly Circular-Arc Graphs
• Weighted maximum-clique transversal sets of graphs
• scientific article; zbMATH DE number 2188345 (Why is no real title available?)
• Linear-time recognition of Helly circular-arc models and graphs
• The clique operator on circular-arc graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503539)