Total colorings of graphs of order 2 n having maximum degree 2 n-2

Bor Liang Chen*, Hung-Lin Fu

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

11 Scopus citations

Abstract

Let χt(G) and †(G) denote respectively the total chromatic number and maximum degree of graph G. Yap, Wang and Zhang proved in 1989 that if G is a graph of order p having †(G)≥p-4, then χt(G≤Δ(G)+2. Hilton has characterized the class of graph G of order 2 n having †(G)=2 n-1 such that χt(G=Δ(G)+2. In this paper, we characterize the class of graphs G of order 2 n having †(G)=2 n-2 such that χt(G=Δ(G)+2

Original languageEnglish
Pages (from-to)119-123
Number of pages5
JournalGraphs and Combinatorics
Volume8
Issue number2
DOIs
StatePublished - 1 Jun 1992

Fingerprint Dive into the research topics of 'Total colorings of graphs of order 2 n having maximum degree 2 n-2'. Together they form a unique fingerprint.

Cite this