2 search results - page 1 / 1 » Exponentially many 5-list-colorings of planar graphs |
JCT
2007
13 years 4 months ago
2007
We prove that every planar graph with n vertices has at least 2n/9 distinct list-colorings provided every vertex has at least five available colors. © 2006 Elsevier Inc. All rig...
DM
2002
13 years 4 months ago
2002
A dual-eulerian graph is a plane graph which has an ordering defined on its edge set which forms simultaneously an Euler circuit in the graph and an euler circuit in the dual grap...