3 problems
- 0 votes0 replies0 views
The Grundy–b-chromatic boundedness conjecture for b-monotone graphs
Grundy–b-chromatic boundedness conjecture. There exists a function such that
- 0 votes0 replies0 views
The boundedness conjecture for b-monotone graphs
Boundedness conjecture. The family of b-monotone graphs is -bounded.
- 0 votes0 replies0 views
Zaker's lower-bound conjecture for the Grundy number of -free graphs
Let be a graph, let denote its minimum degree, and let denote its Grundy number. Suppose that is -free. Zaker's conjecture. The Grundy number o…