A study of the total chromatic number of equibipartite graphs
| dc.citation.epage | 60 | en_US |
| dc.citation.issue | 1-3 | en_US |
| dc.citation.spage | 49 | en_US |
| dc.citation.volume | 184 | en_US |
| dc.citation.woscount | 1 | |
| dc.contributor.author | Chen, BL | en_US |
| dc.contributor.author | Cheng, CK | en_US |
| dc.contributor.author | Fu, HL | en_US |
| dc.contributor.author | Huang, KC | en_US |
| dc.contributor.department | 應用數學系 | zh_TW |
| dc.contributor.department | Department of Applied Mathematics | en_US |
| dc.date.accessioned | 2014-12-08T15:49:10Z | |
| dc.date.available | 2014-12-08T15:49:10Z | |
| dc.date.issued | 1998-04-06 | en_US |
| dc.description.abstract | The total chromatic number chi(t)(G) of a graph G is the least number of colors needed to color the vertices and edges of G so that no adjacent vertices or edges receive the same color, no incident edges receive the same color as either of the vertices it is incident with. In this paper, we obtain some results of the total chromatic number of the equibiparrite graphs of order 2n with maximum degree n - 1. As a part of our results, we disprove the biconformability conjecture. (C) 1998 Published by Elsevier Science B.V. All rights reserved. | en_US |
| dc.identifier.issn | 0012-365X | en_US |
| dc.identifier.journal | DISCRETE MATHEMATICS | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/32672 | |
| dc.identifier.wosnumber | WOS:000072499300004 | |
| dc.language.iso | en_US | en_US |
| dc.title | A study of the total chromatic number of equibipartite graphs | en_US |
| dc.type | Article | en_US |