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