On cliques of Helly Circular-arc Graphs
DOI10.1016/J.ENDM.2008.01.020zbMATH Open1341.05196OpenAlexW1965463345MaRDI QIDQ3503539FDOQ3503539
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
Recommendations
algorithmsclique graphsHelly circular-arc graphsproper Helly circular-arc graphsmaximum weight cliques
Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Graph Classes: A Survey
- Efficient graph representations
- Title not available (Why is that?)
- A partial characterization of clique graphs
- Algorithms for clique-independent sets on subclasses of circular-arc graphs
- A characterization of clique graphs
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Clique Graph Recognition Is NP-Complete
- Proper Helly Circular-Arc Graphs
- An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs
- Title not available (Why is that?)
Cited In (14)
- Algorithms for clique-independent sets on subclasses of circular-arc graphs
- Title not available (Why is that?)
- Weighted maximum-clique transversal sets of graphs
- Linear-time recognition of Helly circular-arc models and graphs
- Proper Helly Circular-Arc Graphs
- A note on the Hadwiger number of circular arc graphs
- Essential obstacles to Helly circular-arc graphs
- Efficient and perfect domination on circular-arc graphs
- Self-clique Helly circular-arc graphs
- The complexity of clique graph recognition
- The clique operator on circular-arc graphs
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- Normal Helly circular-arc graphs and its subclasses
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)
