http://dx.doi.org/10.1137/070687988">
 

Document Type

Journal Article

Department/Unit

Department of Mathematics

Title

Edge-face total chromatic number of Halin graphs

Language

English

Abstract

We show that the edge-face total chromatic number of Halin graphs with maximum vertex degree Δ not less than 4 is equal to max{5, Δ}. For the cases of Δ = 4 and 5, we provide a proper 5-edge-face total coloring algorithm. © 2009 Society for Industrial and Applied Mathematics.

Keywords

Edge-face total chromatic number, Halin graphs

Publication Date

2009

Source Publication Title

SIAM Journal on Discrete Mathematics

Volume

23

Issue

3

Start Page

1646

End Page

1654

Publisher

Society for Industrial and Applied Mathematics

ISSN (print)

08954801

This document is currently not available here.

Share

COinS