The following pages link to Feasible Graphs and Colorings (Q4844508):
Displaying 7 items.
- Feasible graphs with standard universe (Q1295403) (← links)
- Complexity and categoricity (Q1383162) (← links)
- On the lattices of NP-subspaces of a polynomial time vector space over a finite field (Q1923577) (← links)
- Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355) (← links)
- Coloring Graphs with Constraints on Connectivity (Q4978449) (← links)
- Complexity, decidability and completeness (Q5480615) (← links)
- Feasibly categorical models (Q6064288) (← links)