Hau-wen Huang

most citedThe flipping puzzle on a graph

2 citations · 3 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2008★ 1 cited

The edge-flipping group of a graph

Hau-wen Huang, Chih-wen Weng

Let $X = (V, E)$ be a finite simple connected graph with $n$ vertices and $m$ edges. A configuration is an assignment of one of two colors, black or white, to each edge of $X .$ A move…

math.CO2008★ 2 cited

The flipping puzzle on a graph

Hau-wen Huang, Chih-wen Weng

Let $S$ be a connected graph which contains an induced path of $n - 1$ vertices, where $n$ is the order of $S .$ We consider a puzzle on $S$ . A configuration of the puzzle is simply a…