Pages that link to "Item:Q378133"
From MaRDI portal
The following pages link to Computing clique and chromatic number of circular-perfect graphs in polynomial time (Q378133):
Displaying 8 items.
- Polynomial time computability of some graph parameters for superclasses of perfect graphs (Q1758876) (← links)
- On circular-perfect graphs: a survey (Q2225429) (← links)
- Integer round-up property for the chromatic number of some \(h\)-perfect graphs (Q2364493) (← links)
- Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2509770) (← 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)
- (Q3166186) (← links)