K. H. Chew

Generating author description...

All published works

Action	Title	Year	Authors
+	On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs	1997	Kim Ho Chew
+	The chromatic index of graphs of high maximum degree	1996	Kim Ho Chew
+	Total chromatic number of regular graphs of odd order and high degree	1996	Kim Ho Chew
+	Total chromatic number of complete <i>r</i>‐partite graphs	1992	Kim Ho Chew Hian Poh Yap
+ PDF Chat	Total chromatic number of graphs of high degree, II	1992	Hian Poh Yap Kim Ho Chew
+	Error Bounds for the Truncation of Infinite Linear Differential Systems	1980	Kim Ho Chew P. N. Shivakumar J. J. Williams
+	On the conformal mapping of a circular disc with a curvilinear polygonal hole	1977	P. N. Shivakumar Kim Ho Chew
+ PDF Chat	Iterations for Diagonally Dominant Matrices	1976	P. N. Shivakumar K. H. Chew
+ PDF Chat	A Sufficient Condition for Nonvanishing of Determinants	1974	P. N. Shivakumar K. H. Chew
+ PDF Chat	A sufficient condition for nonvanishing of determinants	1974	P. N. Shivakumar K. H. Chew

Common Coauthors

Coauthor	Papers Together
P. N. Shivakumar	5
H. P. Yap	2
J. J. Williams	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Regular Graphs of High Degree are 1-Factorizable	1985	Amanda G. Chetwynd A. J. W. Hilton	3
+	SOME UNSOLVED PROBLEMS IN GRAPH THEORY	1968	V. G. Vizing	3
+	The Colour Numbers of Complete Graphs	1967	Mehdi Behzad Gary Chartrand Jeff Cooper	2
+ PDF Chat	Total chromatic number of graphs of high degree	1989	Hian Poh Yap Jianfang Wang Zhang Zhong-fu	2
+	A Recurring Theorem on Determinants	1949	Olga Taussky	2
+ PDF Chat	Note on Bounds for Determinants with Dominant Principal Diagonal	1952	Alexander Ostrowski	2
+	1-factorizing regular graphs of high degree—an improved bound	1989	Amanda G. Chetwynd A. J. W. Hilton	2
+ PDF Chat	A sufficient condition for nonvanishing of determinants	1974	P. N. Shivakumar K. H. Chew	1
+	Recent results on the total chromatic number	1993	A. J. W. Hilton	1
+	On Total Chromatic Number of a Graph	1971	N. Vijayaditya	1
+	Edge‐coloring of multigraphs: Recoloring technique	1984	Mark Goldberg	1
+	A new method of proving theorems on chromatic index	1984	A. Ehrenfeucht Vance Faber H. A. Kierstead	1
+	Note on bounds for determinants with dominant principal diagonal	1952	Alexander Ostrowski	1
+	The total chromatic number of graphs having large maximum degree	1993	A. J. W. Hilton H.R. Hind	1
+ PDF Chat	Nombre Chromatique Total Du Graphe <i>R</i> -Parti Complet	1974	Jean‐Claude Bermond	1
+ PDF Chat	Total chromatic number of graphs of high degree, II	1992	Hian Poh Yap Kim Ho Chew	1
+	A fuzzy relative of the isodata process and its use in detecting compact well-separated clusters	1973	J. C. Dunn	1
+	The chromatic index of graphs with at most four vertices of maximum degree.	1984	Amanda G. Chetwynd A. J. W. Hilton	1
+	The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small	1990	Amanda G. Chetwynd A. J. W. Hilton	1
+	A NUMERICAL METHOD FOR THE CONFORMAL MAPPING OF FINITE DOUBLY CONNECTED REGIONS	1967	M. K. Richardson Howard B. Wilson	1
+	A Recurring Theorem on Determinants	1949	Olga Taussky	1
+	A Δ-subgraph condition for a graph to be class 1	1989	Amanda G. Chetwynd A. J. W. Hilton	1
+	Convergence of Matrix Iterations Subject to Diagonal Dominance	1973	K. R. James	1
+ PDF Chat	On some conditions for nonvanishing of determinants	1961	Alexander Ostrowski	1
+	Conformal mapping of doubly-connected domains	1969	George T. Symm	1
+	Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree	1990	T. Nießen Lutz Volkmann	1