6 search results - page 2 / 2 » Non-rainbow colorings of 3-, 4- and 5-connected plane graphs |
JGT
2007
13 years 4 months ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...