Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices

MaRDI QID[[Item:|]]

Authors

No records found

Cited in

No records found

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item )