Pages that link to "Item:Q2883567"
From MaRDI portal
The following pages link to Clique and chromatic number of circular-perfect graphs (Q2883567):
Displaying 5 items.
- Computing clique and chromatic number of circular-perfect graphs in polynomial time (Q378133) (← links)
- The balanced connected subgraph problem for geometric intersection graphs (Q2166729) (← links)
- On the theta number of powers of cycle graphs (Q2439827) (← links)
- Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2509770) (← links)
- (Q2857431) (← links)
