標題: THE EQUITABLE CHROMATIC THRESHOLD OF THE CARTESIAN PRODUCT OF BIPARTITE GRAPHS IS AT MOST 4
作者: Yan, Zhidan
Lin, Wu-Hsiung
Wang, Wei
應用數學系
Department of Applied Mathematics
關鍵字: Equitable coloring;Equitable chromatic threshold;Cartesian product;Bipartite graph
公開日期: 1-Jun-2014
摘要: A graph G is equitably k-colorable if its vertex set can be partitioned into k independent sets, any two of which differ in size by at most 1. We prove a conjecture of Lin and Chang which asserts that for any bipartite graphs G and H, their Cartesian product G square H is equitably k-colorable whenever k >= 4.
URI: http://hdl.handle.net/11536/24931
ISSN: 1027-5487
期刊: TAIWANESE JOURNAL OF MATHEMATICS
Volume: 18
Issue: 3
起始頁: 773
結束頁: 780
Appears in Collections:Articles