. Y. Han. On the chromatic number of Shuffle graphs. TR. No. 140-89, Department of Computer Science, University of Kentucky, Lexington, KY 40506, USA. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Parallel Algorithm for Linked List and Beyond - Han (1990) Self-citation (Han) (Correct)
No context found.
. Y. Han. On the chromatic number of Shuffle graphs. TR. No. 140-89, Department of Computer Science, University of Kentucky, Lexington, KY 40506, USA.
Matching Partition a Linked List and Its Optimization - Han (1989) (1 citation) Self-citation (Han) (Correct)
No context found.
. Y. Han. On the chromatic number of shuffle graphs, Technical report, TR 140-89, Dept. of Computer Sci., University of Kentucky, 1989.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC