Pages that link to "Item:Q2500526"
From MaRDI portal
The following pages link to Algorithms for clique-independent sets on subclasses of circular-arc graphs (Q2500526):
Displaying 10 items.
- Efficient and perfect domination on circular-arc graphs (Q324824) (← links)
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- Algorithms for finding clique-transversals of graphs (Q940841) (← links)
- The clique operator on circular-arc graphs (Q987670) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
- Variations of maximum-clique transversal sets on graphs (Q2430591) (← links)
- Clique-perfectness and balancedness of some graph classes (Q2931952) (← links)
- On cliques of Helly Circular-arc Graphs (Q3503539) (← links)
- Clique-perfectness of complements of line graphs (Q5919747) (← links)
