An-Hang Chen

According to our database, An-Hang Chen authored at least 5 papers between 2006 and 2013.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2013

Ranking and Unranking of Non-regular Trees in Gray-Code Order.

Ro-Yu Wu, Jou-Ming Chang, An-Hang Chen, Ming-Tat Ko

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

Ranking and Unranking <i>t</i>-ary Trees in a Gray-Code Order.

Ro-Yu Wu, Jou-Ming Chang, An-Hang Chen, Chun-Liang Liu

Comput. J., 2013

2009

The Interchange Graphs of Tournaments with Minimum Score Vectors Are Exactly Hypercubes.

An-Hang Chen, Jou-Ming Chang, Yue-Li Wang

Graphs Comb., 2009

2008

The existence and uniqueness of strong kings in tournaments.

An-Hang Chen, Jou-Ming Chang, Yuwen Cheng, Yue-Li Wang

Discret. Math., 2008

2006

A Sufficient Condition for Quasi-Claw-Free Hamiltonian Graphs.

Jou-Ming Chang, An-Hang Chen

Ars Comb., 2006