Pages that link to "Item:Q3439325"
From MaRDI portal
The following pages link to Characterization and recognition of Helly circular-arc clique-perfect graphs (Q3439325):
Displaying 4 items.
- NP-hardness of the recognition of coordinated graphs (Q839773) (← links)
- Algorithms for finding clique-transversals of graphs (Q940841) (← links)
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs (Q1025541) (← links)
- On clique-transversals and clique-independent sets (Q1854773) (← links)