# Search results for: Ko-Wei Lih

Discussiones Mathematicae Graph Theory > 2017 > 38 > 1 > 5-26

Optimization Letters > 2017 > 11 > 8 > 1663-1675

*G*on $$n + 1$$ n + 1 vertices, a

*spanning K-tree*$$T_K$$ T K of

*G*is defined to be a spanning tree

*T*of

*G*together with

*K*distinct edges of

*G*that are not edges of

*T*. The objective of the minimum-cost spanning

*K*-tree problem is to choose a subset of edges to form a spanning

*K*-tree with the minimum weight. In this paper, we consider

*the constructing spanning K-tree problem*...

Bulletin of the Malaysian Mathematical Sciences Society > 2018 > 41 > 3 > 1507-1518

*k*,

*d*)-list assignment

*L*of a graph is a function that assigns to each vertex

*v*a list

*L*(

*v*) of at least

*k*colors satisfying $$|L(x)\cap L(y)|\le d$$ |L(x)∩L(y)|≤d for each edge

*xy*. An

*L*-coloring is a vertex coloring $$\pi $$ π such that $$\pi (v) \in L(v)$$ π(v)∈L(v) for each vertex

*v*and $$\pi (x) \ne \pi (y)$$ π(x)≠π(y) for each edge

*xy*. A graph

*G*is (

*k*,

*d*)-choosable if there exists an

*L*-coloring...

*m*-bounded coloring of a graph is a proper coloring such that the sizes of color classes are all bounded by a preassigned number

*m*. Formulas for the equitable and

*m*-bounded chromatic numbers of a split graph are established in this paper. It is proved that split graphs satisfy the...

European Journal of Operational Research > 2014 > 239 > 1 > 80-88

Discrete Applied Mathematics > 2014 > 162 > Complete > 404-408

Discrete Applied Mathematics > 2014 > 162 > Complete > 348-354

Journal of Graph Theory > 72 > 3 > 247 - 266

*acyclic*if any cycle is colored with at least three colors. An

*edge-list L*of a graph

*G*is a mapping that assigns a finite set of positive integers to each edge of

*G*. An acyclic edge coloring ϕ of

*G*such that $\varphi \left(e\right)\in L\left(e\right)$ for any $e\in E\left(G\right)$ is called an

*acyclic L*

*-edge coloring*of

*G*. A graph

*G*is said to be

*acyclically k*

*-edge choosable*if it has an acyclic

*L*...

Journal of Combinatorial Optimization > 2013 > 25 > 4 > 501-504

*G*is said to be equitably

*k*-colorable if there exists a proper

*k*-coloring of

*G*such that the sizes of any two color classes differ by at most one. Let Δ(

*G*) denote the maximum degree of a vertex in

*G*. Two Brooks-type conjectures on equitable Δ(

*G*)-colorability have been proposed in Chen and Yen (Discrete Math., 2011) and Kierstead and Kostochka (Combinatorica 30:201–216, 2010) independently...

Journal of Combinatorial Optimization > 2013 > 25 > 4 > 499-500

Discrete Mathematics > 2012 > 312 > 9 > 1536-1541

Applied Mathematics Letters > 2012 > 25 > 5 > 898-901

Discussiones Mathematicae Graph Theory > 2011 > 31 > 3 > 429-439

European Journal of Combinatorics > 2010 > 31 > 2 > 598-607

Applied Mathematics Letters > 2009 > 22 > 9 > 1369-1373

Discrete Applied Mathematics > 2009 > 157 > 13 > 2969-2972

Discrete Mathematics > 2009 > 309 > 12 > 3767-3773

Discrete Applied Mathematics > 2009 > 157 > 1 > 170-176

European Journal of Combinatorics > 2009 > 30 > 1 > 114-118