A graph is chromatic-choosable if its choice number coincides with its chromatic number. It is shown in this article that, for any graph G, if we join a sufficiently large complete graph to G, thenweâ€¦ (More)

One of the authors has conjectured that every graph G with 2 (G) + 1 or fewer vertices is (G)-choosable. Motivated by this, we investigate the choice numbers of some complete k-partite graphs ofâ€¦ (More)

Let M be a map on a surface F . A geometric realization of M is an embedding of F 2 into a Euclidian 3space R with no self-intersection such that each face of M is a flat polygon. In our talk, weâ€¦ (More)