Name
Abstract | ||
|---|---|---|
A Halin graph is a plane graph H = T boolean OR C, where T is a tree With no vertex of degree two and at least one vertex of degree three or more, and C is a cycle connecting the pendant vertices of T in the cyclic order determined by the drawing of T. In this paper we determine the list chromatic number, the list chromatic index, and the list total chromatic number (except when Delta= 3) of all Halin graphs, where Delta denotes the Maximum degree of H. |
Year | Venue | Keywords |
|---|---|---|
2005 | ARS COMBINATORIA | list coloring, Halin graph |
Field | DocType | Volume |
Edge coloring,Discrete mathematics,Graph,Complete coloring,Combinatorics,Fractional coloring,List coloring,Brooks' theorem,Greedy coloring,Mathematics | Journal | 77 |
ISSN | Citations | PageRank |
0381-7032 | 3 | 0.40 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Weifan Wang | 1 | 868 | 89.92 |
| Ko-wei Lih | 2 | 529 | 58.80 |