Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link |
2002 | Central circuit coverings of octahedrites and medial polyhedra | Deza, Michel; Huang, Tayuan; Lih, Ko-Wei | Journal of Mathematical Research and Exposition 22(1), 49-65 | | | |
2002 | Choosability and edge choosability of planar graphs without five-cycles | Wang, Weifan; Lih, Ko-Wei | Applied Mathematics Letters 15(5), 561-565 | | | |
2002 | Choosability and edge choosability of plane graphs without intersecting triangles | Wang, Weifan; Lih, Ko-Wei | SIAM Journal on Discrete Mathematics 15(4), 538-545 | | | |
2001 | Choosability, edge choosability, and total choosability of outerplane graphs | Wang, Weifan; Lih, Ko-Wei | European Journal of Combinatorics 22(1), 71-78 | | | |
2013 | Chordal graphs are fully orientable | Lih, Ko-Wei; Lai, Hsin-Hao | Ars Combinatoria | | | |
2002 | Circular chromatic numbers of some reduced Kneser graphs | Lih, Ko-Wei; Liu, Daphne Der-Fen | Journal of Graph Theory 41(1), 62-68 | | | |
2003 | Coloring the square of a K4-minor free graph | Lih, Ko-Wei; Wang, Wei-Fan; Zhu, Xuding | Discrete Mathematics 269(1-3), 303-309 | | | |
2006 | Coloring the square of an outerplanar graph | Lih, Ko-Wei; Wang, Wei-Fan | Taiwanses Journal of Mathematics 10(4), 1015-1023 | | | |
2009 | Coloring the square of the Kneser graph KG(2k 1, k) and the Schrijver graph SG(2k 2,k) | Chen, Jun-Yo; Lih, Ko-Wei; Wu, Jiaojiao | Discrete Applied Mathematics 157(1), 170-176 | | | |
1981 | Connected planar graphs are Sperner posets | Lih, Ko-Wei | Tamkang Journal of Mathematics 12, 209-213 | | | |
1977 | Continuous degrees | Lih, Ko-Wei | Bulletin of the Institute of Mathematics, Academia Sinica 5(1), 171-180 | | | |
2008 | Coupled choosability of plane graphs | Wang, Wei-Fan; Lih, Ko-Wei | Journal of Graph Theory 58(1), 27-44 | | | |
1995 | Cyclic tableaux and symmetric functions | Chen, William Y. C.; Lih, Ko-Wei; Yeh, Yeong-Nan | Studies in Applied Mathematics 94(3), 327-339 | | | |
1990 | Diameters of iterated clique graphs of chordal graphs | Chen, Bor-Liang; Lih, Ko-Wei | Journal of Graph Theory 14(3), 391-396 | | | |
2002 | Edge-pancyclicity of coupled graphs | Lih, Ko-Wei; Song, Zengmin; Wang, Weifan; Zhang, Kemin | Discrete Applied Mathematics 119(3), 259-264 | | | |
2002 | Edge-partitions of planar graphs and their game coloring numbers | He, Wenjie; Hou, Xiaoling; Lih, Ko-Wei; Shao, Jiating; Wang, Weifan; Zhu, Xuding | Journal of Graph Theory 41(4), 307-317 | | | |
1996 | Equitable and m-bounded coloring of split graphs | Lih, Ko-Wei; Bor-Liang Chen; Ming-Tat Ko | Lecture Notes in Computer Science(Springer-Verlag) 1120, 1-5 | | | |
1995 | Equitable and m-Bounded Coloring of Split Graphs | Chen, Bor-Liang; Ko, Ming-Tat; Lih, Ko-Wei | | | | |
1994 | Equitable coloring and the maximum degree | Chen, Bor-Liang; Lih, Ko-Wei; Wu, Pou-Lin | European Journal of Combinatorics 15(5), 443-447 | | | |
1994 | Equitable coloring of trees | Chen, Bor-Liang; Lih, Ko-Wei | Journal of Combinatorial Theory Series B 61(1), 83-87 | | | |