Ko-Wei Lih

68 papers C 2Journal 65Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
Partitioning kite-free planar graphs into two forests.
J. Graph Theory
Yang Wang, Yiqiao Wang, Ko-Wei Lih
2022 J jnl
A note on additive choice number of planar graphs.
Discret. Appl. Math.
Hsin-Hao Lai, Ko-Wei Lih
2022 J jnl
Approximation algorithms for constructing required subgraphs using stock pieces of fixed length.
J. Comb. Optim.
Junran Lichen, Jianping Li, Ko-Wei Lih, Xingxing Yu
2021 J jnl
IC-Planar Graphs Are 6-Choosable.
SIAM J. Discret. Math.
Wanshun Yang, Yiqiao Wang, Wei-Fan Wang, Ko-Wei Lih
2020 J jnl
Plane graphs of maximum degree Δ ≥ 7 are edge-face (Δ + 1)-colorable.
J. Graph Theory
Yiqiao Wang, Xiaoxue Hu, Weifan Wang, Ko-Wei Lih
2019 J jnl
A note on m-near-factor-critical graphs.
Eur. J. Comb.
Kuo-Ching Huang, Ko-Wei Lih
2019 C conf
On Approximations for Constructing Required Subgraphs Using Stock Pieces of Fixed Length.
AAIM
Junran Lichen, Jianping Li, Ko-Wei Lih, Xingxing Yu
2018 J jnl
Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces.
Inf. Process. Lett.
Junran Lichen, Jianping Li, Ko-Wei Lih
2018 J jnl
Upper bounds for the strong chromatic index of Halin graphs.
Discuss. Math. Graph Theory
Daphne Der-Fen Liu, Ziyu Hu, Ko-Wei Lih
2017 J jnl
Approximation algorithms for constructing spanning K-trees using stock pieces of bounded length.
Optim. Lett.
Junran Lichen, Jianping Li, Ko-Wei Lih
2015 J jnl
Chordal Graphs are Fully Orientable.
Ars Comb.
Hsin-Hao Lai, Ko-Wei Lih
2015 J jnl
Full Orientability of the Square of a Cycle.
Ars Comb.
Fengwei Xu, Wei-Fan Wang, Ko-Wei Lih
2015 C conf
Legally (\varDelta +2) ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time.
COCOA
Danjun Huang, Ko-Wei Lih, Wei-Fan Wang
2014 J jnl
An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph.
Discret. Appl. Math.
Lianzhu Zhang, Weifan Wang, Ko-Wei Lih
2014 J jnl
Approximation algorithms for solving the constrained arc routing problem in mixed graphs.
Eur. J. Oper. Res.
Honglin Ding, Jianping Li, Ko-Wei Lih
2014 J jnl
Nordhaus-Gaddum-type relations of three graph coloring parameters.
Discret. Appl. Math.
Kuo-Ching Huang, Ko-Wei Lih
2014 J jnl
When is the Direct Product of Generalized Mycielskians a Cover Graph?
Ars Comb.
Hsin-Hao Lai, Ko-Wei Lih, Chen-Ying Lin, Li-Da Tong
2013 J jnl
Acyclic List Edge Coloring of Graphs.
J. Graph Theory
Hsin-Hao Lai, Ko-Wei Lih
2013 J jnl
Equivalence of two conjectures on equitable coloring of graphs.
J. Comb. Optim.
Bor-Liang Chen, Ko-Wei Lih, Chih-Hung Yen
2013 J jnl
Intersecting k-Uniform Families Containing all the k-Subsets of a Given Set.
Electron. J. Comb.
Wei-Tian Li, Bor-Liang Chen, Kuo-Ching Huang, Ko-Wei Lih
2013 J jnl
Preface: optimization in graphs.
J. Comb. Optim.
D. J. Guan, Ko-Wei Lih, Xuding Zhu
2012 J jnl
Chordal Graphs are Fully Orientable
CoRR
Hsin-Hao Lai, Ko-Wei Lih
2012 J jnl
On the strong chromatic index of cubic Halin graphs.
Appl. Math. Lett.
Ko-Wei Lih, Daphne Der-Fen Liu
2012 J jnl
The strong chromatic index of Halin graphs.
Discret. Math.
Hsin-Hao Lai, Ko-Wei Lih, Ping-Ying Tsai
2011 J jnl
Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six.
Discuss. Math. Graph Theory
Yuehua Bu, Ko-Wei Lih, Weifan Wang
2010 J jnl
On preserving full orientability of graphs.
Eur. J. Comb.
Hsin-Hao Lai, Ko-Wei Lih
2009 J jnl
Coloring the square of the Kneser graph
Discret. Appl. Math.
Jun-Yo Chen, Ko-Wei Lih, Jiaojiao Wu
2009 J jnl
Full orientability of graphs with at most one dependent arc.
Discret. Appl. Math.
Hsin-Hao Lai, Ko-Wei Lih, Li-Da Tong
2009 J jnl
Multi-color Ramsey numbers of even cycles.
Eur. J. Comb.
Yusheng Li, Ko-Wei Lih
2009 J jnl
On (d, 1)-total numbers of graphs.
Discret. Math.
Ko-Wei Lih, Daphne Der-Fen Liu, Wei-Fan Wang
2009 J jnl
On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles.
Appl. Math. Lett.
Lan Shen, Yingqian Wang, Wei-Fan Wang, Ko-Wei Lih
2008 J jnl
Coupled choosability of plane graphs.
J. Graph Theory
Wei-Fan Wang, Ko-Wei Lih
2008 J jnl
Non-cover generalized Mycielski, Kneser, and Schrijver graphs.
Discret. Math.
Ko-Wei Lih, Chen-Ying Lin, Li-Da Tong
2008 J jnl
Note on Coloring the Square of an Outerplanar Graph.
Ars Comb.
Wei-Fan Wang, Ko-Wei Lih
2008 J jnl
On fully orientability of 2-degenerate graphs.
Inf. Process. Lett.
Hsin-Hao Lai, Gerard J. Chang, Ko-Wei Lih
2007 J jnl
On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability.
Eur. J. Comb.
Wei-Fan Wang, Ko-Wei Lih
2006 J jnl
On an interpolation property of outerplanar graphs.
Discret. Appl. Math.
Ko-Wei Lih, Chen-Ying Lin, Li-Da Tong
2005 J jnl
List Coloring Halin Graphs.
Ars Comb.
Wei-Fan Wang, Ko-Wei Lih
2004 J jnl
The Linear 2-Arboricity of Outerplanar Graphs.
Ars Comb.
Ko-Wei Lih, Li-Da Tong, Wei-Fan Wang
2004 J jnl
The edge-face choosability of plane graphs.
Eur. J. Comb.
Wei-Fan Wang, Ko-Wei Lih
2003 J jnl
Coloring the square of a
Discret. Math.
Ko-Wei Lih, Wei-Fan Wang, Xuding Zhu
2003 J jnl
Labeling Planar Graphs with Conditions on Girth and Distance Two.
SIAM J. Discret. Math.
Wei-Fan Wang, Ko-Wei Lih
2003 J jnl
The Linear 2-Arboricity of Planar Graphs.
Graphs Comb.
Ko-Wei Lih, Li-Da Tong, Wei-Fan Wang
2002 J jnl
A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs.
Discret. Math.
Wei-Fan Wang, Ko-Wei Lih
2002 J jnl
Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles.
SIAM J. Discret. Math.
Wei-Fan Wang, Ko-Wei Lih
2002 J jnl
Choosability and edge choosability of planar graphs without five cycles.
Appl. Math. Lett.
Wei-Fan Wang, Ko-Wei Lih
2002 J jnl
Circular chromatic numbers of some reduced Kneser graphs.
J. Graph Theory
Ko-Wei Lih, Daphne Der-Fen Liu
2002 J jnl
Edge-pancyclicity of coupled graphs.
Discret. Appl. Math.
Ko-Wei Lih, Zengmin Song, Wei-Fan Wang, Kemin Zhang
2002 J jnl
Edge-partitions of planar graphs and their game coloring numbers.
J. Graph Theory
Wenjie He, Xiaoling Hou, Ko-Wei Lih, Jiating Shao, Weifan Wang, Xuding Zhu
2001 J jnl
A note on list improper coloring planar graphs.
Appl. Math. Lett.
Ko-Wei Lih, Zengmin Song, Wei-Fan Wang, Kemin Zhang
2001 J jnl
An improvement on a spernerity proof of Horrocks.
Theor. Comput. Sci.
Szu-En Cheng, Ko-Wei Lih
2001 J jnl
Choosability, Edge Choosability, and Total Choosability of Outerplane Graphs.
Eur. J. Comb.
Wei-Fan Wang, Ko-Wei Lih
2001 J jnl
On Cycle Sequences.
Graphs Comb.
Ko-Wei Lih, Li-Da Tong, Jing-Ho Yan
2001 J jnl
Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles.
Comb. Probab. Comput.
Weifan Wang, Ko-Wei Lih
2001 J jnl
The 4-choosability of planar graphs without 6-cycles.
Australas. J Comb.
Weifan Wang, Ko-Wei Lih
1999 J jnl
Star Extremal Circulant Graphs.
SIAM J. Discret. Math.
Ko-Wei Lih, Daphne Der-Fen Liu, Xuding Zhu
1997 J jnl
Signed degree sequences of signed graphs.
J. Graph Theory
Jing-Ho Yan, Ko-Wei Lih, David Kuo, Gerard J. Chang
1996 J jnl
On equitable coloring of bipartite graphs.
Discret. Math.
Ko-Wei Lih, Pou-Lin Wu
1995 — conf
Equitable and
Combinatorics and Computer Science
Bor-Liang Chen, Ming-Tat Ko, Ko-Wei Lih
1994 J jnl
Equitable Coloring and the Maximum Degree.
Eur. J. Comb.
Bor-Liang Chen, Ko-Wei Lih, Pou-Lin Wu
1994 J jnl
Equitable Coloring of Trees.
J. Comb. Theory B
Bor-Liang Chen, Ko-Wei Lih
1993 J jnl
A Note on the m-Bounded Chromatic Number of a Tree.
Eur. J. Comb.
Bor-Liang Chen, Ko-Wei Lih
1993 J jnl
Rank inequalities for chordal graphs.
Discret. Math.
Ko-Wei Lih
1990 J jnl
Diameters of iterated clique graphs of chordal graphs.
J. Graph Theory
Bor-Liang Chen, Ko-Wei Lih
1987 J jnl
Hamiltonian uniform subset graphs.
J. Comb. Theory B
Bor-Liang Chen, Ko-Wei Lih
1983 J jnl
Latin Squares and Superqueens.
J. Comb. Theory A
Frank K. Hwang, Ko-Wei Lih
1980 J jnl
Sperner Families over a Subset.
J. Comb. Theory A
Ko-Wei Lih
1978 J jnl
Type Two Partial Degrees.
J. Symb. Log.
Ko-Wei Lih