1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DM2014
Induced matchings in graphs of degree at most 4
Viet Hang Nguyen
We show that if is a connected graph of maximum degree at most , which is not , then the strong matching number of is at least . This bound is…
math.MG2013★ 1 cited
On affine motions and universal rigidity of tensegrity frameworks
A. Y. Alfakih, Viet-Hang Nguyen
Recently, Alfakih and Ye [Lin. Algebra Appl. 438:31--36, 2013] proved that if an -dimensional bar framework on nodes in general position in admits a…
math.CO2012
Basic Packing of Arborescences
Olivier Durand de Gevigney, Viet-Hang Nguyen, Zoltán Szigeti
We provide the directed counterpart of a slight extension of Katoh and Tanigawa's result on rooted-tree decompositions with matroid constraints. Our result characterises digraphs h…