The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nawarat Ananchuen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  10. 3-Factor-criticality in domination critical graphs. [Citation Graph (, )][DBLP]


  11. Matching properties in connected domination critical graphs. [Citation Graph (, )][DBLP]


  12. The structure of 4-gamma-critical graphs with a cut vertex. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002