Pages that link to "Item:Q378133"

The following pages link to Computing clique and chromatic number of circular-perfect graphs in polynomial time (Q378133):

Displaying 3 items.

• 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)