K. H. Chew Total chromatic number of graphs of odd order and high degree. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:205, n:1-3, pp:39-46 [Journal]
K. H. Chew On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:171, n:1-3, pp:283-286 [Journal]
K. H. Chew The chromatic index of graphs of high maximum degree. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:162, n:1-3, pp:77-91 [Journal]
K. H. Chew Total chromatic number of regular graphs of odd order and high degree. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:154, n:1-3, pp:41-51 [Journal]
Search in 0.001secs, Finished in 0.001secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP