The following pages link to Ko-Wei Lih (Q186290):
Displaying 50 items.
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs (Q297063) (← links)
- Intersecting \(k\)-uniform families containing all the \(k\)-subsets of a given set (Q396872) (← links)
- The strong chromatic index of Halin graphs (Q411659) (← links)
- On the strong chromatic index of cubic Halin graphs (Q419099) (← links)
- A note on the \(m\)-bounded chromatic number of a tree (Q685308) (← links)
- On choosability with separation of planar graphs without adjacent short cycles (Q723623) (← links)
- An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph (Q741759) (← links)
- Nordhaus-Gaddum-type relations of three graph coloring parameters (Q741774) (← links)
- On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability (Q854811) (← links)
- Non-cover generalized Mycielski, Kneser, and Schrijver graphs (Q942096) (← links)
- On preserving full orientability of graphs (Q966169) (← links)
- Full orientability of graphs with at most one dependent arc (Q967346) (← links)
- Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\) (Q1003771) (← links)
- On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles (Q1033023) (← links)
- On \((d,1)\)-total numbers of graphs (Q1043541) (← links)
- (Q1071031) (redirect page) (← links)
- Hamiltonian uniform subset graphs (Q1071032) (← links)
- Sperner families over a subset (Q1145697) (← links)
- Equitable coloring of trees (Q1328387) (← links)
- Equitable coloring and the maximum degree (Q1337614) (← links)
- The linear 2-arboricity of planar graphs (Q1401562) (← links)
- Coloring the square of a \(K_{4}\)-minor free graph (Q1402088) (← links)
- Choosability and edge choosability of planar graphs without five cycles (Q1609512) (← links)
- Edge-pancyclicity of coupled graphs (Q1613351) (← links)
- A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs (Q1613521) (← links)
- Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces (Q1641150) (← links)
- Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length (Q1686555) (← links)
- Upper bounds for the strong chromatic index of Halin graphs (Q1692620) (← links)
- Equitable list coloring of graphs (Q1771536) (← links)
- Latin squares and superqueens (Q1837192) (← links)
- Choosability, edge choosability and total choosability of outerplane graphs (Q1840829) (← links)
- The edge-face choosability of plane graphs (Q1883606) (← links)
- On equitable coloring of bipartite graphs (Q1916388) (← links)
- Equivalence of two conjectures on equitable coloring of graphs (Q1956256) (← links)
- Approximation algorithms for constructing required subgraphs using stock pieces of fixed length (Q2082192) (← links)
- A note on additive choice number of planar graphs (Q2172418) (← links)
- A note on \(m\)-near-factor-critical graphs (Q2311372) (← links)
- Rank inequalities for chordal graphs (Q2366014) (← links)
- On fully orientability of 2-degenerate graphs (Q2380068) (← links)
- Coloring the square of an outerplanar graph (Q2472571) (← links)
- Multi-color Ramsey numbers of even cycles (Q2519800) (← links)
- On an interpolation property of outerplanar graphs (Q2581566) (← links)
- Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles (Q2731587) (← links)
- (Q2760437) (← links)
- (Q2764880) (← links)
- Full Orientability of the Square of a Cycle (Q2823213) (← links)
- Chordal Graphs are Fully Orientable (Q2823219) (← links)
- The Minimum Number of Dependent Arcs and a Related Parameter of Generalized Mycielski Graphs (Q2860829) (← links)
- (Q3070238) (← links)
- Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six (Q3092678) (← links)
