Pages that link to "Item:Q3503539"
From MaRDI portal
The following pages link to On cliques of Helly Circular-arc Graphs (Q3503539):
Displaying 13 items.
- Efficient and perfect domination on circular-arc graphs (Q324824) (← links)
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- Linear-time recognition of Helly circular-arc models and graphs (Q627542) (← links)
- The clique operator on circular-arc graphs (Q987670) (← links)
- The complexity of clique graph recognition (Q1019185) (← links)
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs (Q1025541) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
- Essential obstacles to Helly circular-arc graphs (Q2166233) (← links)
- A note on the Hadwiger number of circular arc graphs (Q2379986) (← links)
- Self-clique Helly circular-arc graphs (Q2488933) (← links)
- Algorithms for clique-independent sets on subclasses of circular-arc graphs (Q2500526) (← links)
- Proper Helly Circular-Arc Graphs (Q3508572) (← links)