2 problems
Matching
Improper coloring conjecture for toroidal graphs. Every toroidal graph is -colorable.
Let be a graph and let be a nonnegative integer. Let and denote respectively the -improper chromatic number and the -improper list chromatic…
Improper coloring conjecture for toroidal graphs. Every toroidal graph is -colorable.
Let be a graph and let be a nonnegative integer. Let and denote respectively the -improper chromatic number and the -improper list chromatic…