Name
Abstract | ||
|---|---|---|
Let G be a K4-minor free graph with maximum degree Δ. We prove that the chromatic number of the square of G is at most (i) Δ+3 if 2⩽Δ⩽3; or (ii) ⌊3Δ/2⌋+1 if Δ⩾4. Examples are given to show the bounds can be attained. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0012-365X(03)00059-1 | Discrete Mathematics |
Keywords | DocType | Volume |
Series–parallel graph,K4-minor free graph,Square,Chromatic number | Journal | 269 |
Issue | ISSN | Citations |
1 | 0012-365X | 30 |
PageRank | References | Authors |
2.25 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ko-wei Lih | 1 | 529 | 58.80 |
| Weifan Wang | 2 | 868 | 89.92 |
| Xuding Zhu | 3 | 1883 | 190.19 |