default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKo-Wei Lih
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j63]Hsin-Hao Lai
, Ko-Wei Lih:
A note on additive choice number of planar graphs. Discret. Appl. Math. 321: 357-359 (2022)- [j62]Junran Lichen, Jianping Li, Ko-Wei Lih, Xingxing Yu:
Approximation algorithms for constructing required subgraphs using stock pieces of fixed length. J. Comb. Optim. 44(3): 1774-1795 (2022) - 2021
- [j61]Wanshun Yang, Yiqiao Wang, Wei-Fan Wang, Ko-Wei Lih:
IC-Planar Graphs Are 6-Choosable. SIAM J. Discret. Math. 35(3): 1729-1745 (2021) - 2020
- [j60]Yiqiao Wang, Xiaoxue Hu, Weifan Wang, Ko-Wei Lih:
Plane graphs of maximum degree Δ ≥ 7 are edge-face (Δ + 1)-colorable. J. Graph Theory 95(1): 99-124 (2020)
2010 – 2019
- 2019
- [j59]Kuo-Ching Huang, Ko-Wei Lih:
A note on m-near-factor-critical graphs. Eur. J. Comb. 80: 273-276 (2019) - [c3]Junran Lichen, Jianping Li, Ko-Wei Lih, Xingxing Yu:
On Approximations for Constructing Required Subgraphs Using Stock Pieces of Fixed Length. AAIM 2019: 192-202 - 2018
- [j58]Daphne Der-Fen Liu, Ziyu Hu, Ko-Wei Lih:
Upper bounds for the strong chromatic index of Halin graphs. Discuss. Math. Graph Theory 38(1): 5-26 (2018) - [j57]Junran Lichen, Jianping Li, Ko-Wei Lih:
Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces. Inf. Process. Lett. 137: 11-16 (2018) - 2017
- [j56]Junran Lichen, Jianping Li, Ko-Wei Lih:
Approximation algorithms for constructing spanning K-trees using stock pieces of bounded length. Optim. Lett. 11(8): 1663-1675 (2017) - 2015
- [j55]Fengwei Xu, Wei-Fan Wang, Ko-Wei Lih:
Full Orientability of the Square of a Cycle. Ars Comb. 122: 227-233 (2015) - [j54]Hsin-Hao Lai, Ko-Wei Lih:
Chordal Graphs are Fully Orientable. Ars Comb. 122: 289-298 (2015) - [c2]Danjun Huang, Ko-Wei Lih, Wei-Fan Wang:
Legally (\varDelta +2) ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time. COCOA 2015: 617-632 - 2014
- [j53]Hsin-Hao Lai, Ko-Wei Lih, Chen-Ying Lin, Li-Da Tong:
When is the Direct Product of Generalized Mycielskians a Cover Graph? Ars Comb. 117: 65-73 (2014) - [j52]Lianzhu Zhang, Weifan Wang, Ko-Wei Lih:
An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph. Discret. Appl. Math. 162: 348-354 (2014) - [j51]Kuo-Ching Huang, Ko-Wei Lih:
Nordhaus-Gaddum-type relations of three graph coloring parameters. Discret. Appl. Math. 162: 404-408 (2014) - [j50]Honglin Ding, Jianping Li, Ko-Wei Lih:
Approximation algorithms for solving the constrained arc routing problem in mixed graphs. Eur. J. Oper. Res. 239(1): 80-88 (2014) - 2013
- [j49]Wei-Tian Li, Bor-Liang Chen, Kuo-Ching Huang, Ko-Wei Lih:
Intersecting k-Uniform Families Containing all the k-Subsets of a Given Set. Electron. J. Comb. 20(3): 38 (2013) - [j48]D. J. Guan, Ko-Wei Lih, Xuding Zhu:
Preface: optimization in graphs. J. Comb. Optim. 25(4): 499-500 (2013) - [j47]Bor-Liang Chen, Ko-Wei Lih, Chih-Hung Yen:
Equivalence of two conjectures on equitable coloring of graphs. J. Comb. Optim. 25(4): 501-504 (2013) - [j46]Hsin-Hao Lai, Ko-Wei Lih:
Acyclic List Edge Coloring of Graphs. J. Graph Theory 72(3): 247-266 (2013) - 2012
- [j45]Ko-Wei Lih, Daphne Der-Fen Liu:
On the strong chromatic index of cubic Halin graphs. Appl. Math. Lett. 25(5): 898-901 (2012) - [j44]Hsin-Hao Lai, Ko-Wei Lih, Ping-Ying Tsai:
The strong chromatic index of Halin graphs. Discret. Math. 312(9): 1536-1541 (2012) - [i1]Hsin-Hao Lai, Ko-Wei Lih:
Chordal Graphs are Fully Orientable. CoRR abs/1202.5718 (2012) - 2011
- [j43]Yuehua Bu, Ko-Wei Lih, Weifan Wang:
Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six. Discuss. Math. Graph Theory 31(3): 429-439 (2011) - 2010
- [j42]Hsin-Hao Lai, Ko-Wei Lih:
On preserving full orientability of graphs. Eur. J. Comb. 31(2): 598-607 (2010)
2000 – 2009
- 2009
- [j41]Lan Shen, Yingqian Wang, Wei-Fan Wang, Ko-Wei Lih:
On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles. Appl. Math. Lett. 22(9): 1369-1373 (2009) - [j40]Jun-Yo Chen, Ko-Wei Lih, Jiaojiao Wu:
Coloring the square of the Kneser graph I and the Schrijver graph I. Discret. Appl. Math. 157(1): 170-176 (2009) - [j39]Hsin-Hao Lai, Ko-Wei Lih, Li-Da Tong:
Full orientability of graphs with at most one dependent arc. Discret. Appl. Math. 157(13): 2969-2972 (2009) - [j38]Ko-Wei Lih, Daphne Der-Fen Liu, Wei-Fan Wang:
On (d, 1)-total numbers of graphs. Discret. Math. 309(12): 3767-3773 (2009) - [j37]Yusheng Li, Ko-Wei Lih:
Multi-color Ramsey numbers of even cycles. Eur. J. Comb. 30(1): 114-118 (2009) - 2008
- [j36]Wei-Fan Wang, Ko-Wei Lih:
Note on Coloring the Square of an Outerplanar Graph. Ars Comb. 86 (2008) - [j35]Ko-Wei Lih, Chen-Ying Lin, Li-Da Tong:
Non-cover generalized Mycielski, Kneser, and Schrijver graphs. Discret. Math. 308(20): 4653-4659 (2008) - [j34]Hsin-Hao Lai, Gerard J. Chang, Ko-Wei Lih:
On fully orientability of 2-degenerate graphs. Inf. Process. Lett. 105(5): 177-181 (2008) - [j33]Wei-Fan Wang, Ko-Wei Lih:
Coupled choosability of plane graphs. J. Graph Theory 58(1): 27-44 (2008) - 2007
- [j32]Wei-Fan Wang, Ko-Wei Lih:
On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability. Eur. J. Comb. 28(1): 111-120 (2007) - 2006
- [j31]Ko-Wei Lih, Chen-Ying Lin, Li-Da Tong:
On an interpolation property of outerplanar graphs. Discret. Appl. Math. 154(1): 166-172 (2006) - 2005
- [j30]Wei-Fan Wang, Ko-Wei Lih:
List Coloring Halin Graphs. Ars Comb. 77 (2005) - 2004
- [j29]Ko-Wei Lih, Li-Da Tong, Wei-Fan Wang:
The Linear 2-Arboricity of Outerplanar Graphs. Ars Comb. 73 (2004) - [j28]Wei-Fan Wang, Ko-Wei Lih:
The edge-face choosability of plane graphs. Eur. J. Comb. 25(7): 935-948 (2004) - 2003
- [j27]Ko-Wei Lih, Wei-Fan Wang, Xuding Zhu:
Coloring the square of a K4-minor free graph. Discret. Math. 269(1-3): 303-309 (2003) - [j26]Ko-Wei Lih, Li-Da Tong, Wei-Fan Wang:
The Linear 2-Arboricity of Planar Graphs. Graphs Comb. 19(2): 241-248 (2003) - [j25]Wei-Fan Wang, Ko-Wei Lih:
Labeling Planar Graphs with Conditions on Girth and Distance Two. SIAM J. Discret. Math. 17(2): 264-275 (2003) - 2002
- [j24]Wei-Fan Wang, Ko-Wei Lih:
Choosability and edge choosability of planar graphs without five cycles. Appl. Math. Lett. 15(5): 561-565 (2002) - [j23]Ko-Wei Lih, Zengmin Song, Wei-Fan Wang, Kemin Zhang:
Edge-pancyclicity of coupled graphs. Discret. Appl. Math. 119(3): 259-264 (2002) - [j22]Wei-Fan Wang, Ko-Wei Lih:
A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs. Discret. Math. 253(1-3): 87-95 (2002) - [j21]Ko-Wei Lih, Daphne Der-Fen Liu:
Circular chromatic numbers of some reduced Kneser graphs. J. Graph Theory 41(1): 62-68 (2002) - [j20]Wenjie He, Xiaoling Hou, Ko-Wei Lih, Jiating Shao, Weifan Wang, Xuding Zhu:
Edge-partitions of planar graphs and their game coloring numbers. J. Graph Theory 41(4): 307-317 (2002) - [j19]Wei-Fan Wang, Ko-Wei Lih:
Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles. SIAM J. Discret. Math. 15(4): 538-545 (2002) - 2001
- [j18]Weifan Wang, Ko-Wei Lih:
The 4-choosability of planar graphs without 6-cycles. Australas. J Comb. 24: 157-164 (2001) - [j17]Ko-Wei Lih, Zengmin Song, Wei-Fan Wang, Kemin Zhang:
A note on list improper coloring planar graphs. Appl. Math. Lett. 14(3): 269-273 (2001) - [j16]Weifan Wang, Ko-Wei Lih:
Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles. Comb. Probab. Comput. 10(3): 267-276 (2001) - [j15]Wei-Fan Wang, Ko-Wei Lih:
Choosability, Edge Choosability, and Total Choosability of Outerplane Graphs. Eur. J. Comb. 22(1): 71-78 (2001) - [j14]Ko-Wei Lih, Li-Da Tong, Jing-Ho Yan:
On Cycle Sequences. Graphs Comb. 17(1): 129-133 (2001) - [j13]Szu-En Cheng, Ko-Wei Lih:
An improvement on a spernerity proof of Horrocks. Theor. Comput. Sci. 263(1-2): 355-377 (2001)
1990 – 1999
- 1999
- [j12]Ko-Wei Lih, Daphne Der-Fen Liu, Xuding Zhu:
Star Extremal Circulant Graphs. SIAM J. Discret. Math. 12(4): 491-499 (1999) - 1997
- [j11]Jing-Ho Yan, Ko-Wei Lih, David Kuo, Gerard J. Chang:
Signed degree sequences of signed graphs. J. Graph Theory 26(2): 111-117 (1997) - 1996
- [j10]Ko-Wei Lih, Pou-Lin Wu:
On equitable coloring of bipartite graphs. Discret. Math. 151(1-3): 155-160 (1996) - 1995
- [c1]Bor-Liang Chen, Ming-Tat Ko, Ko-Wei Lih:
Equitable and m-Bounded Coloring of Split Graphs. Combinatorics and Computer Science 1995: 1-5 - 1994
- [j9]Bor-Liang Chen, Ko-Wei Lih, Pou-Lin Wu:
Equitable Coloring and the Maximum Degree. Eur. J. Comb. 15(5): 443-447 (1994) - [j8]Bor-Liang Chen, Ko-Wei Lih:
Equitable Coloring of Trees. J. Comb. Theory B 61(1): 83-87 (1994) - 1993
- [j7]Ko-Wei Lih:
Rank inequalities for chordal graphs. Discret. Math. 113(1-3): 125-130 (1993) - [j6]Bor-Liang Chen, Ko-Wei Lih:
A Note on the m-Bounded Chromatic Number of a Tree. Eur. J. Comb. 14(4): 311-312 (1993) - 1990
- [j5]Bor-Liang Chen, Ko-Wei Lih:
Diameters of iterated clique graphs of chordal graphs. J. Graph Theory 14(3): 391-396 (1990)
1980 – 1989
- 1987
- [j4]Bor-Liang Chen, Ko-Wei Lih:
Hamiltonian uniform subset graphs. J. Comb. Theory B 42(3): 257-263 (1987) - 1983
- [j3]Frank K. Hwang, Ko-Wei Lih:
Latin Squares and Superqueens. J. Comb. Theory A 34(1): 110-114 (1983) - 1980
- [j2]Ko-Wei Lih:
Sperner Families over a Subset. J. Comb. Theory A 29(2): 182-185 (1980)
1970 – 1979
- 1978
- [j1]Ko-Wei Lih:
Type Two Partial Degrees. J. Symb. Log. 43(4): 623-629 (1978)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-13 23:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
