Search the dblp DataBase
Ko-Wei Lih: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Bor-Liang Chen, Ming-Tat Ko, Ko-Wei Lih
Equitable and m-Bounded Coloring of Split Graphs. [Citation Graph (0, 0)][DBLP]
Combinatorics and Computer Science, 1995, pp:1-5 [Conf] - Ko-Wei Lih, Zengmin Song, Weifan Wang, Kemin Zhang
A note on list improper coloring planar graphs. [Citation Graph (0, 0)][DBLP]
Appl. Math. Lett., 2001, v:14, n:3, pp:269-273 [Journal] - Weifan Wang, Ko-Wei Lih
Choosability and edge choosability of planar graphs without five cycles. [Citation Graph (0, 0)][DBLP]
Appl. Math. Lett., 2002, v:15, n:5, pp:561-565 [Journal] - Ko-Wei Lih, Li-Da Tong, Wei-Fan Wang
The Linear 2-Arboricity of Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
Ars Comb., 2004, v:73, n:, pp:- [Journal] - Wei-Fan Wang, Ko-Wei Lih
List Coloring Halin Graphs. [Citation Graph (0, 0)][DBLP]
Ars Comb., 2005, v:77, n:, pp:- [Journal] - Ko-Wei Lih, Chen-Ying Lin, Li-Da Tong
On an interpolation property of outerplanar graphs. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 2006, v:154, n:1, pp:166-172 [Journal] - Ko-Wei Lih, Zengmin Song, Weifan Wang, Kemin Zhang
Edge-pancyclicity of coupled graphs. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 2002, v:119, n:3, pp:259-264 [Journal] - Ko-Wei Lih, Wei-Fan Wang, Xuding Zhu
Coloring the square of a K4-minor free graph. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2003, v:269, n:1-3, pp:303-309 [Journal] - Weifan Wang, Ko-Wei Lih
A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2002, v:253, n:1-3, pp:87-95 [Journal] - Bor-Liang Chen, Ko-Wei Lih
A Note on the m-Bounded Chromatic Number of a Tree. [Citation Graph (0, 0)][DBLP]
Eur. J. Comb., 1993, v:14, n:4, pp:311-312 [Journal] - Bor-Liang Chen, Ko-Wei Lih, Pou-Lin Wu
Equitable Coloring and the Maximum Degree. [Citation Graph (0, 0)][DBLP]
Eur. J. Comb., 1994, v:15, n:5, pp:443-447 [Journal] - Weifan Wang, Ko-Wei Lih
Choosability, Edge Choosability, and Total Choosability of Outerplane Graphs. [Citation Graph (0, 0)][DBLP]
Eur. J. Comb., 2001, v:22, n:1, pp:71-78 [Journal] - Wei-Fan Wang, Ko-Wei Lih
The edge-face choosability of plane graphs. [Citation Graph (0, 0)][DBLP]
Eur. J. Comb., 2004, v:25, n:7, pp:935-948 [Journal] - Wei-Fan Wang, Ko-Wei Lih
On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability. [Citation Graph (0, 0)][DBLP]
Eur. J. Comb., 2007, v:28, n:1, pp:111-120 [Journal] - Ko-Wei Lih, Li-Da Tong, Wei-Fan Wang
The Linear 2-Arboricity of Planar Graphs. [Citation Graph (0, 0)][DBLP]
Graphs and Combinatorics, 2003, v:19, n:2, pp:241-248 [Journal] - Ko-Wei Lih, Li-Da Tong, Jing-Ho Yan
On Cycle Sequences. [Citation Graph (0, 0)][DBLP]
Graphs and Combinatorics, 2001, v:17, n:1, pp:129-133 [Journal] - Bor-Liang Chen, Ko-Wei Lih
Hamiltonian uniform subset graphs. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1987, v:42, n:3, pp:257-263 [Journal] - Bor-Liang Chen, Ko-Wei Lih
Equitable Coloring of Trees. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1994, v:61, n:1, pp:83-87 [Journal] - Frank K. Hwang, Ko-Wei Lih
Latin Squares and Superqueens. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 1983, v:34, n:1, pp:110-114 [Journal] - Ko-Wei Lih
Sperner Families over a Subset. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 1980, v:29, n:2, pp:182-185 [Journal] - Ko-Wei Lih
Type Two Partial Degrees. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1978, v:43, n:4, pp:623-629 [Journal] - Ko-Wei Lih, Daphne Der-Fen Liu, Xuding Zhu
Star Extremal Circulant Graphs. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1999, v:12, n:4, pp:491-499 [Journal] - Weifan Wang, Ko-Wei Lih
Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 2002, v:15, n:4, pp:538-545 [Journal] - Weifan Wang, Ko-Wei Lih
Labeling Planar Graphs with Conditions on Girth and Distance Two. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 2003, v:17, n:2, pp:264-275 [Journal] - Szu-En Cheng, Ko-Wei Lih
An improvement on a spernerity proof of Horrocks. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2001, v:263, n:1-2, pp:355-377 [Journal] - Ko-Wei Lih
Rank inequalities for chordal graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1993, v:113, n:1-3, pp:125-130 [Journal] - Ko-Wei Lih, Pou-Lin Wu
On equitable coloring of bipartite graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1996, v:151, n:1-3, pp:155-160 [Journal]
On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles. [Citation Graph (, )][DBLP]
Note on Coloring the Square of an Outerplanar Graph. [Citation Graph (, )][DBLP]
Coloring the square of the Kneser graph I and the Schrijver graph I. [Citation Graph (, )][DBLP]
Full orientability of graphs with at most one dependent arc. [Citation Graph (, )][DBLP]
Non-cover generalized Mycielski, Kneser, and Schrijver graphs. [Citation Graph (, )][DBLP]
On (d, 1)-total numbers of graphs. [Citation Graph (, )][DBLP]
Multi-color Ramsey numbers of even cycles. [Citation Graph (, )][DBLP]
On preserving full orientability of graphs. [Citation Graph (, )][DBLP]
Search in 0.026secs, Finished in 0.028secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002