The following pages link to Konrad Piwakowski (Q1356705):
Displaying 14 items.
- (Q237436) (redirect page) (← links)
- The smallest hard-to-color graph for the SL algorithm (Q1356706) (← links)
- On Ramsey number \(R(4,3,3)\) and triangle-free edge-chromatic graphs in three colors (Q1356712) (← links)
- A linear time algorithm for edge coloring of binomial trees (Q1916114) (← links)
- Applying tabu search to determine new Ramsey graphs (Q1918865) (← links)
- On some Ramsey and Turán-type numbers for paths and cycles (Q2500974) (← links)
- (Q4256003) (← links)
- Computation of the Folkman numberFe(3, 3; 5) (Q4265586) (← links)
- (Q4393385) (← links)
- (Q4529451) (← links)
- (Q4737346) (← links)
- (Q5461430) (← links)
- (Q5463527) (← links)
- The smallest hard-to-color graph for algorithm DSATUR (Q5959099) (← links)
