Ko-Wei Lih

Equitable coloring and the maximum degree

Abstract Let Δ(G) denote the maximum degree of a graph G . The equitable Δ-coloring conjecture asserts that a connected graph G is equitably Δ( G )-colorable if it is different from K m , C 2 m + 1 and K 2 m + 1,2 m + 1 for all m ⩾ 1. This conjecture is established for graphs G satisfying Δ( G ) ⩾ | G |/2 or Δ( G ) ⩽ 3.

Labeling Planar Graphs with Conditions on Girth and Distance Two

For a planar graph

On equitable coloring of bipartite graphs

G

Equitable coloring of trees

, let

Choosability and Edge Choosability of Planar Graphs without Five Cycles

\Delta(G)

Coloring the square of a K 4 -minor free graph

,

The Equitable Coloring of Graphs

g(G)

A note on list improper coloring planar graphs

, and

Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles

\lambda(G;p,q)

Hamiltonian uniform subset graphs

denote, respectively, its maximum degree, girth, and