Pages that link to "Item:Q2509770"
From MaRDI portal
The following pages link to Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2509770):
Displaying 7 items.
- Computing clique and chromatic number of circular-perfect graphs in polynomial time (Q378133) (← links)
- Characterizing and bounding the imperfection ratio for some classes of graphs (Q1016110) (← links)
- Polynomial time computability of some graph parameters for superclasses of perfect graphs (Q1758876) (← links)
- On circular-perfect graphs: a survey (Q2225429) (← links)
- On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs (Q2840514) (← links)
- Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2857431) (← links)
- Clique and chromatic number of circular-perfect graphs (Q2883567) (← links)