#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2010

2016

- This year (0)
- Last 5 years (5)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

We provide the directed counterpart of a slight extension of Katoh and Tanigawaâ€™s result [8] on rooted-tree decompositions with matroid constraints. Our result characterises digraphs having a packingâ€¦ (More)

- Viet Hang Nguyen
- SIAM J. Discrete Math.
- 2016

We show that if G is a connected graph of maximum degree at most 4, which is not C2,5, then the strong matching number of G is at least 1 9n(G). This bound is tight and the proof implies a polynomialâ€¦ (More)

- Olivier Durand de Gevigney, Viet Hang Nguyen, ZoltÃ¡n Szigeti
- SIAM J. Discrete Math.
- 2013

We provide the directed counterpart of a slight extension of Katoh and Tanigawaâ€™s result [8] on rooted-tree decompositions with matroid constraints. Our result characterizes digraphs having a packingâ€¦ (More)

- Viet Hang Nguyen
- SIAM J. Discrete Math.
- 2010

The problem of characterizing the generic rigidity matroid combinatorially is completely solved in dimension 2 but still open in higher dimensions. As a generalization of the generic rigidityâ€¦ (More)

- Tibor JordÃ¡n, Viet Hang Nguyen
- Contributions to Discrete Mathematics
- 2015

We give a complete characterization of universally rigid one-dimensional barand-joint frameworks in general position with a complete bipartite underlying graph. We also discuss several open questionsâ€¦ (More)

- Olivier Durand de Gevigney, Sulamita Klein, Viet Hang Nguyen, ZoltÃ¡n Szigeti
- Journal of the Brazilian Computer Society
- 2012

The graph sandwich problem for property Î is defined as follows: Given two graphs G1=(V,E1) and G2=(V,E2) such that E1âŠ†E2, is there a graph G=(V,E) such that E1âŠ†EâŠ†E2 which satisfies property Î ? Weâ€¦ (More)

- Viet Hang Nguyen
- 2013

rigidity matroids â€“ and show that although in dimension 2 a 1-extendable abstract rigidity matroid coincides with the generic rigidity matroid, in dimension 3 they can be different. Section 4.4 isâ€¦ (More)

- Bill Jackson, Viet Hang Nguyen
- Eur. J. Comb.
- 2015

Weconsider graded sparse graphs: graphs satisfying different sparsity conditions for different types of edges. We provide an inductive construction for these graphs and a decomposition into â€˜gradedâ€¦ (More)

- Viet Hang Nguyen
- Int. J. Comput. Geometry Appl.
- 2012

The problem of deciding the unique realizability of a graph in a Euclidean space with distance and/or direction constraints on the edges of the graph has applications in CAD (Computer-Aided Design)â€¦ (More)

- â€¹
- 1
- â€º