Pages that link to "Item:Q2857431"
From MaRDI portal
The following pages link to Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2857431):
Displaying 5 items.
- Polynomial time computability of some graph parameters for superclasses of perfect graphs (Q1758876) (← links)
- A transformation which preserves the clique number (Q1850572) (← links)
- Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2509770) (← links)
- Clique and chromatic number of circular-perfect graphs (Q2883567) (← links)
- Polynomial algorithms for perfect graphs (Q3216686) (← links)