TOTAL COLORINGS OF GRAPHS OF ORDER 2N HAVING MAXIMUM DEGREE 2N-2
| dc.citation.epage | 123 | en_US |
| dc.citation.issue | 2 | en_US |
| dc.citation.spage | 119 | en_US |
| dc.citation.volume | 8 | en_US |
| dc.citation.woscount | 10 | |
| dc.contributor.author | CHEN, BL | en_US |
| dc.contributor.author | FU, HL | en_US |
| dc.contributor.department | 應用數學系 | zh_TW |
| dc.contributor.department | Department of Applied Mathematics | en_US |
| dc.date.accessioned | 2014-12-08T15:05:02Z | |
| dc.date.available | 2014-12-08T15:05:02Z | |
| dc.date.issued | 1992 | en_US |
| dc.description.abstract | Let chi(t)(G) and DELTA(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 DELTA(G) greater-than-or-equal-to p - 4, then chi(t)(G) less-than-or-equal-to DELTA(G) + 2. Hilton has characterized the class of graph G of order 2n having DELTA(G) = 2n - 1 such that chi(t)(G) = DELTA(G) + 2. In this paper, we charactarize the class of graphs G of order 2n having DELTA(G) = 2n - 2 such that chi(t)(G) = DELTA(G) + 2. | en_US |
| dc.identifier.doi | 10.1007/BF02350630 | en_US |
| dc.identifier.issn | 0911-0119 | en_US |
| dc.identifier.journal | GRAPHS AND COMBINATORICS | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1007/BF02350630 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/3554 | |
| dc.identifier.wosnumber | WOS:A1992JK60000004 | |
| dc.language.iso | en_US | en_US |
| dc.title | TOTAL COLORINGS OF GRAPHS OF ORDER 2N HAVING MAXIMUM DEGREE 2N-2 | en_US |
| dc.type | Article | en_US |