Pages that link to "Item:Q2883567"
From MaRDI portal
The following pages link to Clique and chromatic number of circular-perfect graphs (Q2883567):
Displaying 10 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)
- The balanced connected subgraph problem for geometric intersection graphs (Q2166729) (← links)
- Integer round-up property for the chromatic number of some \(h\)-perfect graphs (Q2364493) (← 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)
- 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)
- (Q4623033) (← links)
- Colouring clique-hypergraphs of circulant graphs (Q5900086) (← links)