Aung Kyaw

According to our database, Aung Kyaw authored at least 8 papers between 1998 and 2013.

Collaborative distances:

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

2013

A Note on Leaf-constrained Spanning Trees in a Graph.

Mikio Kano, Aung Kyaw

Ars Comb., 2013

2012

Spanning trees with a bounded number of leaves in a claw-free graph.

Mikio Kano, Aung Kyaw, Haruhide Matsuda, Kenta Ozeki, Akira Saito, Tomoki Yamashita

Ars Comb., 2012

2011

Spanning trees with at most k leaves in K_{1, 4}-free graphs.

Aung Kyaw

Discret. Math., 2011

2009

Spanning trees with at most 3 leaves in K_{1, 4}-free graphs.

Aung Kyaw

Discret. Math., 2009

2007

A sufficient condition for spanning trees with bounded maximum degree in a graph.

Aung Kyaw

Australas. J Comb., 2007

2001

A Sufficient Condition for a Graph to Have a k-tree.

Aung Kyaw

Graphs Comb., 2001

1999

A counterexample to a conjecture of Jackson and Wormald.

Aung Kyaw

Australas. J Comb., 1999

1998

Maximal Trees with Bounded Maximum Degree in a Graph.

Min Aung, Aung Kyaw

Graphs Comb., 1998