Ko-Wei Lih

发表

Majorization of Finite Partially Ordered Sets

Ko-Wei Lih, 1982 .

The strong chromatic index of Halin graphs

Ko-Wei Lih, Ping-Ying Tsai, Hsin-Hao Lai, 2012, Discret. Math..

Circular chromatic numbers of some reduced Kneser graphs

Ko-Wei Lih, Daphne Der-Fen Liu, Ko-Wei Lih, 2002 .

Problems in Finite Extremal Set Theory

Ko-Wei Lih, Ko-Wei Lih, 1987 .

COLORING THE SQUARE OF AN OUTERPLANAR GRAPH

Ko-Wei Lih, Weifan Wang, Ko-Wei Lih, 2006 .

Transmission of probability theory into China

Ko-Wei Lih, M. Siu, 2013 .

Approximation algorithms for constructing required subgraphs using stock pieces of fixed length

Ko-Wei Lih, Xingxing Yu, Jianping Li, 2020 .

From One Gnomon to Two Gnomons: A Methodological Study of the Method of Double Differences

Ko-Wei Lih, 1993 .

Approximation algorithms for constructing spanning K-trees using stock pieces of bounded length

Ko-Wei Lih, Jianping Li, Junran Lichen, 2016, Optimization Letters.

Equivalence of two conjectures on equitable coloring of graphs

Ko-Wei Lih, Bor-Liang Chen, Chih-Hung Yen, 2013, J. Comb. Optim..

Latin Squares and Superqueens

Ko-Wei Lih, Frank K. Hwang, F. Hwang, 1983, J. Comb. Theory, Ser. A.

Non-cover generalized Mycielski, Kneser, and Schrijver graphs

Ko-Wei Lih, Li-Da Tong, Chen-Ying Lin, 2008, Discret. Math..

Equitable Coloring of Graphs

Ko-Wei Lih, Ko-Wei Lih, 1998 .

Equitable coloring of interval graphs and products of graphs

Ko-Wei Lih, Bor-Liang Chen, Jing-Ho Yan, 2009, 0903.1396.

Approximation algorithms for solving the constrained arc routing problem in mixed graphs

Jianping Li, Ko-Wei Lih, Honglin Ding, 2014, Eur. J. Oper. Res..

Multi-color Ramsey numbers of even cycles

Ko-Wei Lih, Yusheng Li, Ko-Wei Lih, 2009, Eur. J. Comb..

Hamiltonian uniform subset graphs

Ko-Wei Lih, Bor-Liang Chen, Ko-Wei Lih, 1987, J. Comb. Theory, Ser. B.

On fully orientability of 2-degenerate graphs

Ko-Wei Lih, Gerard J. Chang, Hsin-Hao Lai, 2008, Inf. Process. Lett..

Legally (\varDelta +2) ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time

Ko-Wei Lih, Wei-Fan Wang, Danjun Huang, 2015, COCOA.

An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph

Ko-Wei Lih, Wei-Fan Wang, Lianzhu Zhang, 2012, Discret. Appl. Math..

Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six

Ko-Wei Lih, Wei-Fan Wang, Yuehua Bu, 2011, Discuss. Math. Graph Theory.

Cyclic Tableaux and Symmetric Functions

Yeong-Nan Yeh, Ko-Wei Lih, William Y. C. Chen, 1995 .

Choosability, Edge Choosability, and Total Choosability of Outerplane Graphs

Ko-Wei Lih, Wei-Fan Wang, Ko-Wei Lih, 2001, Eur. J. Comb..

Circular chromatic numbers of some reduced Kneser graphs

Daphne Der-Fen Liu, Shmuel Friedland, Reinhard Nabben, 2002 .

Labeling Planar Graphs with Conditions on Girth and Distance Two

Ko-Wei Lih, Wei-Fan Wang, Ko-Wei Lih, 2004, SIAM J. Discret. Math..

The Linear 2-Arboricity of Planar Graphs

Ko-Wei Lih, Wei-Fan Wang, Li-Da Tong, 2003, Graphs Comb..

Edge-partitions of planar graphs and their game coloring numbers

Vladimir Gurvich, Endre Boros, Stefan Hougardy, 2002 .

Edge‐partitions of planar graphs and their game coloring numbers

Xuding Zhu, Ko-Wei Lih, Xiaoling Hou, 2002, J. Graph Theory.

Star Extremal Circulant Graphs

Xuding Zhu, Ko-Wei Lih, Daphne Der-Fen Liu, 1999, SIAM J. Discret. Math..

92.80 The edge-choosability of the tetrahedron

Ko-Wei Lih, David Cariolaro, Ko-Wei Lih, 2008, The Mathematical Gazette.

Chordal Graphs are Fully Orientable

Ko-Wei Lih, Hsin-Hao Lai, Ko-Wei Lih, 2012, Ars Comb..

On Choosability with Separation of Planar Graphs Without Adjacent Short Cycles

Ko-Wei Lih, Min Chen, Weifan Wang, 2018 .

On Choosability with Separation of Planar Graphs Without Adjacent Short Cycles

Ko-Wei Lih, Min Chen, Weifan Wang, 2016, Bulletin of the Malaysian Mathematical Sciences Society.

Approximation Algorithms for the Generalized Multiple Knapsack Problems with K Restricted Elements

Ko-Wei Lih, Jianping Li, Binchao Huang, 2015, 2015 7th International Conference on Intelligent Human-Machine Systems and Cybernetics.

Monotonicity conjecture on permanents of doubly stochastic matrices

Ko-Wei Lih, E. T. Wang, 1981 .

Choosability and edge choosability of planar graphs without five cycles

Ko-Wei Lih, Wei-Fan Wang, Ko-Wei Lih, 2002, Appl. Math. Lett..

Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles

Ko-Wei Lih, Wei-Fan Wang, Ko-Wei Lih, 2002, SIAM J. Discret. Math..

A note on additive choice number of planar graphs

Ko-Wei Lih, Hsin-Hao Lai, 2022, Discret. Appl. Math..

Upper Bounds for the Strong Chromatic Index of Halin Graphs

Ko-Wei Lih, Daphne Der-Fen Liu, Ziyu Hu, 2018, Discuss. Math. Graph Theory.