I agree that this site is using cookies. You can find further informations here.
X
Lih, Ko-Wei
678  results:
Search for persons X
?
1

A note on additive choice number of planar graphs:

Lai, Hsin-Hao ; Lih, Ko-Wei
Discrete Applied Mathematics.  321 (2022)  - p. 357-359 , 2022
Link: https://doi.org/10.1016/..
 
?
2

IC-Planar Graphs Are 6-Choosable:

Yang, Wanshun ; Wang, Yiqiao ; Wang, Weifan.
SIAM Journal on Discrete Mathematics.  35 (2021)  3 - p. 1729-1745 , 2021
Link: https://doi.org/10.1137/..
 
?
3

Approximation algorithms for constructing required subgraph..:

Lichen, Junran ; Li, Jianping ; Lih, Ko-Wei.
Journal of Combinatorial Optimization.  44 (2020)  3 - p. 1774-1795 , 2020
Link: https://doi.org/10.1007/..
 
?
4

On Approximations for Constructing Required Subgraphs Using..:

, In: Algorithmic Aspects in Information and Management; Lecture Notes in Computer Science,
Lichen, Junran ; Li, Jianping ; Lih, Ko-Wei. - p. 192-202 , 2019
Link: https://doi.org/10.1007/..
 
?
5

A note on m-near-factor-critical graphs:

Huang, Kuo-Ching ; Lih, Ko-Wei
European Journal of Combinatorics.  80 (2019)  - p. 273-276 , 2019
Link: https://doi.org/10.1016/..
 
?
6

Approximation algorithms for constructing specific subgraph..:

Lichen, Junran ; Li, Jianping ; Lih, Ko-Wei
Information Processing Letters.  137 (2018)  - p. 11-16 , 2018
Link: https://doi.org/10.1016/..
 
?
7

Approximation algorithms for constructing spanning K-trees ..:

Lichen, Junran ; Li, Jianping ; Lih, Ko-Wei
Optimization Letters.  11 (2016)  8 - p. 1663-1675 , 2016
Link: https://doi.org/10.1007/..
 
?
8

On Choosability with Separation of Planar Graphs Without Ad..:

Chen, Min ; Lih, Ko-Wei ; Wang, Weifan
Bulletin of the Malaysian Mathematical Sciences Society.  41 (2016)  3 - p. 1507-1518 , 2016
Link: https://doi.org/10.1007/..
 
?
9

An improved upper bound on the adjacent vertex distinguishi..:

Zhang, Lianzhu ; Wang, Weifan ; Lih, Ko-Wei
Discrete Applied Mathematics.  162 (2014)  - p. 348-354 , 2014
Link: https://doi.org/10.1016/..
 
?
10

Approximation algorithms for solving the constrained arc ro..:

Ding, Honglin ; Li, Jianping ; Lih, Ko-Wei
European Journal of Operational Research.  239 (2014)  1 - p. 80-88 , 2014
Link: https://doi.org/10.1016/..
 
?
11

Nordhaus–Gaddum-type relations of three graph coloring para..:

Huang, Kuo-Ching ; Lih, Ko-Wei
Discrete Applied Mathematics.  162 (2014)  - p. 404-408 , 2014
Link: https://doi.org/10.1016/..
 
?
12

Preface: optimization in graphs:

Guan, D. J. ; Lih, Ko-Wei ; Zhu, Xuding
Journal of Combinatorial Optimization.  25 (2013)  4 - p. 499-500 , 2013
Link: https://doi.org/10.1007/..
 
?
13

Acyclic List Edge Coloring of Graphs:

Lai, Hsin-Hao ; Lih, Ko-Wei
Journal of Graph Theory.  72 (2012)  3 - p. 247-266 , 2012
Link: https://doi.org/10.1002/..
 
?
14

The strong chromatic index of Halin graphs:

Lai, Hsin-Hao ; Lih, Ko-Wei ; Tsai, Ping-Ying
Discrete Mathematics.  312 (2012)  9 - p. 1536-1541 , 2012
Link: https://doi.org/10.1016/..
 
?
15

On the strong chromatic index of cubic Halin graphs:

Lih, Ko-Wei ; Liu, Daphne Der-Fen
Applied Mathematics Letters.  25 (2012)  5 - p. 898-901 , 2012
Link: https://doi.org/10.1016/..
 
1-15