Name
Abstract | ||
|---|---|---|
A plane graph G is coupled k-choosable if, for any list assignment L satisfying $|{{L}}({{x}})|= {{k}}$ for every ${{x}}\in {{V}}({{G}})\cup {{F}}({{G}})$, there is a coloring that assigns to each vertex and each face a color from its list such that any two adjacent or incident elements receive distinct colors. We prove that every plane graph is coupled 7-choosable. We further show that maximal plane graphs, ${{K}}_{{4}}$-minor free graphs, and plane graphs with maximum degree at most three are coupled 6-choosable. © 2008 Wiley Periodicals, Inc. J Graph Theory 58: 27–44, 2008 |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1002/jgt.v58:1 | Journal of Graph Theory |
Keywords | Field | DocType |
maximum degree,minor free graph,list assignment l,wiley periodicals,plane graph g,inc. j graph theory,distinct color,plane graph,incident element,maximal plane graph | Graph theory,Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Degree (graph theory),Planar graph,Mathematics | Journal |
Volume | Issue | ISSN |
58 | 1 | 0364-9024 |
Citations | PageRank | References |
7 | 0.66 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Weifan Wang | 1 | 868 | 89.92 |
| Ko-wei Lih | 2 | 529 | 58.80 |