標題: Total chromatic number of graphs of order 2n+1 having maximum degree 2n-1
作者: Yap, HP
Chen, BL
Fu, HL
應用數學系
Department of Applied Mathematics
公開日期: 1-Dec-1995
摘要: 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.
URI: http://hdl.handle.net/11536/1632
ISSN: 0024-6107
期刊: JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES
Volume: 52
Issue: 
起始頁: 434
結束頁: 446
Appears in Collections:Articles