Results 1-85 of 85 (Search time: 0.002 seconds).
| Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link | |
|---|---|---|---|---|---|---|---|
| 1 | 2008 | 92.80 The edge-choosability of the tetrahedron | Cariolaro, David; Lih, Ko-Wei | Mathematical Gazette 92(525), 543-546 | |||
| 2 | 1982 | A convexity inequality on the permanent of doubly stochastic matrices | Lih, Ko-Wei ; Lih, Ko-Wei; Wang, E. T. H. | Congressus Numerantium 36, 189-198 | |||
| 3 | 2002 | A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs | Lih, Ko-Wei ; Weifan, Wang; Lih, Ko-Wei | Discrete Mathematics 253(1-3), 87-95 | |||
| 4 | 2001 | A note on list improper coloring planar graphs | Lih, Ko-Wei ; Song, Zengmin; Wang, Weifan; Zhang, Kemin | Applied Mathematics Letters 14(3), 269-273 | |||
| 5 | 2019 | A note on m-near-factor-critical graphs | Huang, Kuo-Ching; Lih, Ko-Wei | European Journal of Combinatorics 80, 273-276 | |||
| 6 | 1993 | A note on the m-bounded chromatic number of a tree | Bor-Liang Chen; Ko-Wei Lih | European Journal of Combinatorics 14(4), 311-312 | |||
| 7 | 2010 | A remarkable Euler square before Euler | Lih, Ko-Wei | Mathematics Magazine 83(3), 163-167 | |||
| 8 | 2013 | Acyclic list edge coloring of graphs | Lih, Ko-Wei ; Lai, Hsin-Hao | Journal of Graph Theory 72(3), 247-266 | |||
| 9 | 2010 | Acyclic list edge coloring of planar graphs | Lih, Ko-Wei ; Lai, Hsin-Hao | Bulletin of the Institute of Mathematics, Academia Sinica (New Series) 5(4), 413-436 | |||
| 10 | 2011 | Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six | Yuehua Bu; Lih, Ko-Wei ; Weifan Wang | Discussiones Mathematicae Graph Theory31(3), 429-439 | |||
| 11 | 2001 | An improvement on a spernerity proof of Horrocks | Szu-En Cheng; Ko-Wei Lih | Theoretical Computer Science 263(1-2), 355-377 | |||
| 12 | 2020 | Approximation algorithms for constructing required subgraphs using stock pieces of fixed length | Lichen, Junran; Li, Jianping; Lih, Ko-Wei ; Yu, Xingxing | Journal of Combinatorial Optimization RESTRICTED ACCESS | |||
| 13 | 2018 | Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces | Lichen, Junran; Li, Jianping; Lih, Ko-Wei | Information Processing Letters 137, 11-16 | |||
| 14 | 2014 | Approximation algorithms for solving the constrained arc routing problem in mixed graphs | Honglin Ding; Jianping Li; Ko-Wei Lih | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 239, 80-88 | |||
| 15 | 1987 | Bao Qi-Shou and his polyhedral Hun Yuan Tu | Lih, Ko-Wei | Science and Technology in Chinese Civilization (World Scientific, Singapore), 93-108 | |||
| 16 | 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 | |||
| 17 | 2002 | Choosability and edge choosability of planar graphs without five-cycles | Wang, Weifan; Lih, Ko-Wei | Applied Mathematics Letters 15(5), 561-565 | |||
| 18 | 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 | |||
| 19 | 2001 | Choosability, edge choosability, and total choosability of outerplane graphs | Wang, Weifan; Lih, Ko-Wei | European Journal of Combinatorics 22(1), 71-78 | |||
| 20 | 2013 | Chordal graphs are fully orientable | Lih, Ko-Wei ; Lai, Hsin-Hao | Ars Combinatoria | |||
| 21 | 2002 | Circular chromatic numbers of some reduced Kneser graphs | Lih, Ko-Wei ; Liu, Daphne Der-Fen | Journal of Graph Theory 41(1), 62-68 | |||
| 22 | 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 | |||
| 23 | 2006 | Coloring the square of an outerplanar graph | Lih, Ko-Wei ; Wang, Wei-Fan | Taiwanses Journal of Mathematics 10(4), 1015-1023 | |||
| 24 | 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 | |||
| 25 | 1981 | Connected planar graphs are Sperner posets | Lih, Ko-Wei | Tamkang Journal of Mathematics 12, 209-213 | |||
| 26 | 1977 | Continuous degrees | Lih, Ko-Wei | Bulletin of the Institute of Mathematics, Academia Sinica 5(1), 171-180 | |||
| 27 | 2008 | Coupled choosability of plane graphs | Wang, Wei-Fan; Lih, Ko-Wei | Journal of Graph Theory 58(1), 27-44 | |||
| 28 | 1995 | Cyclic tableaux and symmetric functions | Chen, William Y. C.; Lih, Ko-Wei ; Yeh, Yeong-Nan | Studies in Applied Mathematics 94(3), 327-339 | |||
| 29 | 1990 | Diameters of iterated clique graphs of chordal graphs | Chen, Bor-Liang; Lih, Ko-Wei | Journal of Graph Theory 14(3), 391-396 | |||
| 30 | 2002 | Edge-pancyclicity of coupled graphs | Lih, Ko-Wei ; Song, Zengmin; Wang, Weifan; Zhang, Kemin | Discrete Applied Mathematics 119(3), 259-264 | |||
| 31 | 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 | |||
| 32 | 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 | |||
| 33 | 1994 | Equitable coloring and the maximum degree | Chen, Bor-Liang; Lih, Ko-Wei ; Wu, Pou-Lin | European Journal of Combinatorics 15(5), 443-447 | |||
| 34 | 1994 | Equitable coloring of trees | Chen, Bor-Liang; Lih, Ko-Wei | Journal of Combinatorial Theory Series B 61(1), 83-87 | |||
| 35 | 2009 | Equitable colorings of interval graphs and products of graphs | Chen, Bor-Liang; Lih, Ko-Wei ; Yan, Jing-Ho | Festschrift in honor of Preofessor Man-Keung Siu, arXiv:0903.1396 | |||
| 36 | 2004 | Equitable list coloring of graphs | Wang, Wei-Fan; Lih, Ko-Wei | Taiwanese Journal of Mathematics 8(4), 747-759 | |||
| 37 | 2013 | Equivalence of two conjectures on equitable coloring of graphs | Lih, Ko-Wei ; Chen, Bor-Liang; Yen, Chih-Hung | Journal of Combinatorial Optimization 25(4), 501-504 | |||
| 38 | 1977 | Exact difference triangles | Chang, G. J.; Hu, M. C.; Lih, Ko-Wei ; Shieh, T. C. | Bulletin of the Institute of Mathematics (Academia Sinica) 5(1), 191-197 | |||
| 39 | 1993 | From one gnomon to two gnomons: a methodological study of the method of double differences | Lih, Ko-Wei | Philosophy and Conceptual History of Science in Taiwan (Boston Studies in the Philosophy of Science 141, Kluwer Academic Publishers, Dordrecht), 149-166 | |||
| 40 | 2009 | Full orientability of graphs with at most one dependent arc | Lai, Hsin-Hao; Lih, Ko-Wei ; Tong, Li-Da | Discrete Applied Mathematics 157(13), 2969-2972 | |||
| 41 | 2013 | Full orientability of the square of a cycle | Lih, Ko-Wei ; Xu, Fengwei; Wang, Weifan | Ars Combinatoria | |||
| 42 | 1987 | Hamiltonian uniform subset graphs | Chen, Bor-Liang; Lih, Ko-Wei | Journal of Combinatorial Theory, Series B 42(3), 257-263 | |||
| 43 | 2012 | Interpreting the squares of order nine in Choe Sok-chong's Kusuryak | Lih, Ko-Wei | Studies in the History of Natural Sciences 31(1), 52-63 | |||
| 44 | 2004 | Labeling planar graphs with conditions on girth and distance two | Wang, Weifan; Lih, Ko-Wei | SIAM Journal on Discrete Mathematics 17(2), 264-275 | |||
| 45 | 1983 | Latin squares and superqueens | Hwang, F. K.; Lih, Ko-Wei | Journal of Combinatorial Theory, Series A 34(1), 110-114 | |||
| 46 | 2000 | Light 3-faces of plane graphs without 6-cycles | Wang, Wei-Fan; Lih, Ko-Wei | Tamsui Oxford Journal of Mathematical Sciences 16, 205-212 | |||
| 47 | 2004 | Light subgraphs and edge choosability of planar graphs without 3-cycles and 4-cycles | Wang, Wei-Fan; Lih, Ko-Wei | Tamsui Oxford Journal of Mathematical Sciences 20, 353-376 | |||
| 48 | 2005 | List coloring Halin graphs | Lih, Ko-Wei ; Wang, Wei-Fan | Ars Combinatoria 77, 53-63 | |||
| 49 | 1982 | Majorization on finite partially ordered sets | Lih, Ko-Wei | SIAM Journal on Algebraic and Discrete Methods 3(4), 495-503 | |||
| 50 | 1981 | Monotonicity conjecture of permanents of doubly stochastic matrices | Lih, Ko-Wei ; E. T. H. Wang | Proceedings of the American Mathematical Society 82, 173-178 | |||
| 51 | 2009 | Multi-color Ramsey numbers of even cycles | Li, Yusheng; Lih, Ko-Wei | European Journal of Combinatorics 30(1), 114-118 | |||
| 52 | 2008 | Non-cover generalized Mycielski, Kneser, and Schrijver graphs | Lih, Ko-Wei ; Lin, Chen-Ying; Tong, Li-Da | Discrete Mathematics 308(20), 4653-4659 | |||
| 53 | 2008 | Note on coloring the square of an outerplanar graph | Wang, Wei-Fan; Lih, Ko-Wei | Ars Combinatoria 86 | |||
| 54 | 2009 | On (d,1)-total number of graphs | Lih, Ko-Wei ; Liu, Daphne Der-Fen; Wang, Weifan | Discrete Mathematics 309(12), 3767-3773 | |||
| 55 | 2006 | On an interpolation property of outerplanar graphs | Lih, Ko-Wei ; Lin, Chen-Ying; Tong, Li-Da | Discrete Applied Mathematics 154(1), 166-172 | |||
| 56 | 2001 | On cycle sequences | Lih, Ko-Wei ; Tong, Li-Da; Yan, Jing-Ho | Graphs and Combinatorics 17(1), 129-133 | |||
| 57 | 1996 | On equitable coloring of bipartite graphs | Lih, Ko-Wei ; Wu, Pou-Lin | Discrete Mathematics 151(1-3), 155-160 | |||
| 58 | 2008 | On fully orientability of 2-degenerate graphs | Lai, Hsin-Hao; Chang, Gerard J.; Lih, Ko-Wei | Information Processing Letters 105(5), 177-181 | |||
| 59 | 1983 | On magic and consecutive labelings of plane graphs | Lih, Ko-Wei | Utilitas Mathematica 24, 165-197 | |||
| 60 | 2010 | On preserving full orientability of graphs | Lai, Hsin-Hao; Lih, Ko-Wei | European Journal of Combinatorics 31(2), 598-607 | |||
| 61 | 2009 | On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles | Shen, Lan; Wang, Yingqian; Wang, Weifan; Lih, Ko-Wei | Applied Mathematics Letters 22(9), 1369-1373 | |||
| 62 | 2007 | On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability | Wang, Wei-Fan; Lih, Ko-Wei | European Journal of Combinatorics 28(1), 111-120 | |||
| 63 | 2012 | On the strong chromatic index of cubic Halin graphs | Lih, Ko-Wei ; Liu, Daphne Der-Fen | Applied Mathematics Letters 25(5), 898-901 | |||
| 64 | 1981 | Permanental affine subspaces of generalized doubly stochastic matrices | Lih, Ko-Wei ; Wang, E. T. H. | Bulletin of the Institute of Mathematics; Academia Sinica 9, 69-74 | |||
| 65 | 2020 | Plane graphs of maximum degree Δ ≥ 7 are edge‐face (Δ + 1)‐colorable | Wang, Yiqiao; Hu, Xiaoxue; Wang, Weifan; Lih, Ko‐Wei | Journal of Graph Theory 95(1), 99-124 | |||
| 66 | 1977 | Polynomial representation of primes | Chang, G. J.; Lih, Ko-Wei | Tamkang Journal of Mathematics 8, 197-198 | |||
| 67 | 1993 | Rank inequalities for chordal graphs | Lih, Ko-Wei | Discrete Mathematics 113(1-3), 125-130 | |||
| 68 | 1988 | Ranks of chordal graphs | Lih, Ko-Wei | Bulletin of the Institute of Mathematics, Academia Sinica 16(4), 357-364 | |||
| 69 | 1995 | Should we care if the brain is a computer? | Lih, Ko-Wei | Mind and Cognition: Collected Papers from 1993 International Symposium on Mind & Cognition (Institute of European and American Studies, Academia Sinica, Taipei), 83-94 | |||
| 70 | 1997 | Signed degree sequences of signed graphs | Yan, Jing-Ho; Lih, Ko-Wei ; Kuo, David; Chang, Gerard J. | Journal of Graph Theory 26(2), 111-117 | |||
| 71 | 1980 | Sperner families over a subset | Lih, Ko-Wei | Journal of Combinatorial Theory, Series A 29(2), 182-185 | |||
| 72 | 1999 | Star-extremal circulant graphs | Lih, Ko-Wei ; Liu, Daphne Der-Fen; Zhu, Xuding | SIAM Journal on Discrete Mathematics 12(4), 491-499 | |||
| 73 | 2001 | Structural properties and edge choosability of plane graphs without 6-cycles | Wang, Weifan; Ko-Wei Lih | Combinatorics, Probability and Computing 10(3), 267-276 | |||
| 74 | 2001 | The 4-choosability of planar graphs without 6-cycles | Wang, Weifan; Lih, Ko-Wei | Australasian Journal of Combinatorics 24, 157-164 | |||
| 75 | 2004 | The edge-face choosability of plane graphs | Wang, Wei-Fan; Lih, Ko-Wei | European Journal of Combinatorics 25(7), 935-948 | |||
| 76 | 1998 | The equitable coloring of graphs | Lih, Ko-Wei | Handbook of Combinatorial Optimization Volume1-3, 2015-2038 | |||
| 77 | 2004 | The linear 2-arboricity of outerplanar graphs | Lih, Ko-Wei ; Tong, Li-Da; Wang, Wei-Fan | Ars Combinatoria 73, 13-22 | |||
| 78 | 2003 | The linear 2-arboricity of planar graphs | Lih, Ko-Wei ; Tong, Li-Da; Wang, Wei-Fan | Graphs and Combinatorics 19, 241-248 | |||
| 79 | 2013 | The minimum number of dependent arcs and a related parameter of generalized Mycielski graphs | Lai, Hsin-Hao; Lih, Ko-Wei | UTILITAS MATHEMATICA | |||
| 80 | 2011 | The minimum number of dependent arcs in $C^{3}_{3k}$ | Xu, Fengwei; Wang, Weifan; Lih, Ko-Wei | Tamsui Oxford Journal of Information and Mathematical Sciences 27(4), 37-50 | |||
| 81 | 2012 | The strong chromatic index of Halin graphs | Lai, Hsin-Hao; Lih, Ko-Wei ; Tsai, Ping-Ying | Discrete Mathematics 312(9), 1536-1541 | |||
| 82 | 2002 | The Whitney's triangulations of planar graphs | Lih, Ko-Wei ; Wang, Weifan | Bulletin of the Institute of Combinatorics and Its Applications 34, 55-57 | |||
| 83 | 1997 | Two classes of super-magic quartic graphs | Lih, Ko-Wei ; Baca, B.; Hollander, I.; Lih, Ko-Wei | Journal of Combinatorial Mathematics and Combinatorial Computing 23, 113-120 | |||
| 84 | 1978 | Type two partial degrees | Lih, Ko-Wei | Journal of Symbolic Logic 43(4), 623-629 | |||
| 85 | 2013 | When is the direct product of generalized Mycielskians a cover graph? | Lih, Ko-Wei ; Lai, Hsin-Hao; Lin, Chen-Ying; Tong, Li-Da | Ars Combinatoria (arXiv:1202.5720 [math.CO]) |
