| 2008 |
|---|
| 11 | EE | Nawarat Ananchuen,
Watcharaphong Ananchuen,
Michael D. Plummer:
Matching properties in connected domination critical graphs.
Discrete Mathematics 308(7): 1260-1267 (2008) |
| 2007 |
|---|
| 10 | EE | Nawarat Ananchuen,
Lou Caccetta,
Watcharaphong Ananchuen:
A characterization of maximal non-k-factor-critical graphs.
Discrete Mathematics 307(1): 108-114 (2007) |
| 9 | EE | Nawarat Ananchuen,
Michael D. Plummer:
Matchings in 3-vertex-critical graphs: The odd case.
Discrete Mathematics 307(13): 1651-1658 (2007) |
| 8 | EE | Nawarat Ananchuen,
Michael D. Plummer:
3-Factor-criticality in domination critical graphs.
Discrete Mathematics 307(23): 3006-3015 (2007) |
| 2006 |
|---|
| 7 | EE | Nawarat Ananchuen,
Michael D. Plummer:
Errata to "Matching properties in domination critical graphs" [Discrete Math 277 (2004) 1-13].
Discrete Mathematics 306(2): 291 (2006) |
| 6 | EE | Nawarat Ananchuen,
Michael D. Plummer:
Erratum to: "Some results related to the toughness of 3-domination critical graphs" [Discrete Math 272 (2003) 5-15].
Discrete Mathematics 306(2): 292 (2006) |
| 2005 |
|---|
| 5 | EE | Nawarat Ananchuen,
Michael D. Plummer:
Matchings in 3-vertex-critical graphs: The even case.
Networks 45(4): 210-213 (2005) |
| 2004 |
|---|
| 4 | EE | Nawarat Ananchuen,
Michael D. Plummer:
Matching properties in domination critical graphs.
Discrete Mathematics 277(1-3): 1-13 (2004) |
| 2003 |
|---|
| 3 | EE | Nawarat Ananchuen,
Akira Saito:
Factor criticality and complete closure of graphs.
Discrete Mathematics 265(1-3): 13-21 (2003) |
| 2 | EE | Nawarat Ananchuen,
Michael D. Plummer:
Some results related to the toughness of 3-domination critical graphs.
Discrete Mathematics 272(1): 5-15 (2003) |
| 1997 |
|---|
| 1 | EE | Nawarat Ananchuen,
Lou Caccetta:
Matching extension and minimum degree.
Discrete Mathematics 170(1-3): 1-13 (1997) |
