Name
Title | ||
|---|---|---|
On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability |
Abstract | ||
|---|---|---|
There are two main theorems stated in the introduction section. Theorem A gives upper bounds on the sizes of graphs that are 2-cell embedded in a surface of nonnegative Euler characteristic and contain no cycles of specified lengths. Some of these bounds are used in Theorem B to confirm the List Edge Coloring Conjecture for such graphs with maximum degree exceeding prescribed thresholds. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.ejc.2005.09.002 | Eur. J. Comb. |
Keywords | Field | DocType |
graphs embeddable,introduction section,list edge coloring conjecture,theorem b,maximum degree,theorem a,specified length,prescribed threshold,main theorem,upper bound,nonnegative euler characteristic,edge coloring,euler characteristic | Discrete mathematics,Graph,Combinatorics,Euler characteristic,Degree (graph theory),List edge-coloring,Brooks' theorem,Conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
28 | 1 | 0195-6698 |
Citations | PageRank | References |
0 | 0.34 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Weifan Wang | 1 | 868 | 89.92 |
| Ko-wei Lih | 2 | 529 | 58.80 |