Total chromatic number of graphs of order 2n+1 having maximum degree 2n-1

dc.citation.epage	446	en_US
dc.citation.issue		en_US
dc.citation.spage	434	en_US
dc.citation.volume	52	en_US
dc.citation.woscount	2
dc.contributor.author	Yap, HP	en_US
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:03:03Z
dc.date.available	2014-12-08T15:03:03Z
dc.date.issued	1995-12-01	en_US
dc.description.abstract	Let G be a graph of order 2n+1 having maximum degree 2n-1. We prove that the total chromatic number of G is 2n if and only if e(G-w) + alpha'(G-w) greater than or equal to n, where w is a vertex of minimum degree in G, G-w is the complement of G-w, e(G-w) is the size of G-w, and alpha'(G-w) is the edge independence number of G-w.	en_US
dc.identifier.issn	0024-6107	en_US
dc.identifier.journal	JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES	en_US
dc.identifier.uri	https://ir.lib.nycu.edu.tw/handle/11536/1632
dc.identifier.wosnumber	WOS:A1995TX52900002
dc.language.iso	en_US	en_US
dc.title	Total chromatic number of graphs of order 2n+1 having maximum degree 2n-1	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1