Name
Affiliation
Papers
KO-WEI LIH
Institute of Mathematics, Academia Sinica, Nankang, Taipei 115, Taiwan e-mail: makwlih@sinica.edu.tw TW
62
Collaborators
Citations 
PageRank 
47
529
58.80
Referers 
Referees 
References 
540
326
317
Search Limit
100540
Title
Citations
PageRank
Year
Approximation algorithms for constructing required subgraphs using stock pieces of fixed length00.342022
Ic-Planar Graphs Are 6-Choosable00.342021
Plane Graphs Of Maximum Degree Delta >= 7 Are Edge-Face (Delta+1)-Colorable00.342020
A note on m-near-factor-critical graphs00.342019
Upper bounds for the strong chromatic index of Halin graphs.00.342018
Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces.00.342018
Approximation algorithms for constructing spanning K-trees using stock pieces of bounded length.00.342017
Legally $$\\varDelta +2$$Δ+2-Coloring Bipartite Outerplanar Graphs in Cubic Time00.342015
Chordal Graphs are Fully Orientable00.342015
Full Orientability of the Square of a Cycle.00.342015
An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph40.572014
Nordhaus-Gaddum-type relations of three graph coloring parameters10.372014
When is the Direct Product of Generalized Mycielskians a Cover Graph?00.342014
Approximation algorithms for solving the constrained arc routing problem in mixed graphs.20.352014
Preface: optimization in graphs.00.342013
Equivalence of two conjectures on equitable coloring of graphs.10.362013
Intersecting k-Uniform Families Containing all the k-Subsets of a Given Set.00.342013
Acyclic List Edge Coloring of Graphs.00.342013
On the strong chromatic index of cubic Halin graphs.60.522012
The strong chromatic index of Halin graphs50.492012
Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six.100.752011
On preserving full orientability of graphs20.442010
Multi-color Ramsey numbers of even cycles90.782009
On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles60.572009
Coloring the square of the Kneser graph I and the Schrijver graph I30.422009
On (d,1)-total numbers of graphs110.662009
Full orientability of graphs with at most one dependent arc10.372009
Non-cover generalized Mycielski, Kneser, and Schrijver graphs00.342008
Note On Coloring The Square Of An Outerplanar Graph00.342008
Coupled choosability of plane graphs70.662008
On fully orientability of 2-degenerate graphs50.552008
On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability00.342007
On an interpolation property of outerplanar graphs70.692006
List Coloring Halin Graphs30.402005
The Linear 2-Arboricity Of Outerplanar Graphs10.382004
The edge-face choosability of plane graphs70.572004
Coloring the square of a K4-minor free graph302.252003
Labeling Planar Graphs with Conditions on Girth and Distance Two463.432003
The Linear 2-Arboricity of Planar Graphs120.872003
Choosability and edge choosability of planar graphs without five cycles361.962002
Edge-partitions of planar graphs and their game coloring numbers434.242002
Circular chromatic numbers of some reduced Kneser graphs101.352002
Edge-pancyclicity of coupled graphs80.782002
Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles241.292002
A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs.80.632002
A note on list improper coloring planar graphs241.722001
Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles100.752001
An improvement on a Spernerity proof of Horrocks00.342001
Choosability, edge choosability, and total choosability of outerplane graphs161.072001
On Cycle Sequences00.342001
  • 1
  • 2