Name
Abstract | ||
|---|---|---|
A plane graph G is said to be k-edge-face choosable if, for every list L of colors satisfying |L(x)|=k for every edge and face x, there exists a coloring which assigns to each edge and each face a color from its list so that any adjacent or incident elements receive different colors. We prove that every plane graph G with maximum degree Δ(G) is (Δ(G)+3)-edge-face choosable. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.ejc.2003.12.007 | Eur. J. Comb. |
Keywords | Field | DocType |
edge-face choosable,maximum degree,edge-face choosability,plane graph g,k-edge-face choosable,list l,incident element,different color,plane graph,satisfiability | Discrete mathematics,Edge coloring,Graph,Combinatorics,List coloring,String graph,Degree (graph theory),Mathematics,Planar graph,Graph coloring | Journal |
Volume | Issue | ISSN |
25 | 7 | 0195-6698 |
Citations | PageRank | References |
7 | 0.57 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Weifan Wang | 1 | 868 | 89.92 |
| Ko-wei Lih | 2 | 529 | 58.80 |