The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Dingjun Lou: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dingjun Lou, Ning Zhong
    A Highly Efficient Algorithm to Determine Bicritical Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:349-356 [Conf]
  2. Dingjun Lou
    A Local Neighbourhood Condition for Cycles. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1997, v:45, n:, pp:- [Journal]
  3. Dingjun Lou, Akira Saito, Lihua Teng
    To Determine 1-Extendable Graphs and its Algorithm. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:69, n:, pp:- [Journal]
  4. Dingjun Lou, Wei Wang
    An Efficient Algorithm for Cyclic Edge Connectivity of Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:77, n:, pp:- [Journal]
  5. Dingjun Lou, Qinglin Yu
    Connectivity of k-extendable graphs with large k. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:136, n:1, pp:55-61 [Journal]
  6. Robert E. L. Aldred, Derek A. Holton, Dingjun Lou, Akira Saito
    M-alternating paths in n-extendable bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:1-11 [Journal]
  7. Robert E. L. Aldred, Derek A. Holton, Dingjun Lou, Ning Zhong
    Characterizing 2k-critical graphs and n-extendable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:135-139 [Journal]
  8. Dingjun Lou, Dongning Rao
    Graphs with no M-alternating path between two vertices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:280, n:1-3, pp:237-240 [Journal]
  9. Dingjun Lou, Akira Saito, Lihua Teng
    A note on internally disjoint alternating paths in bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:290, n:1, pp:105-108 [Journal]
  10. Xuelian Wen, Dingjun Lou
    Characterizing defect n-extendable bipartite graphs with different connectivities. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:15, pp:1898-1908 [Journal]
  11. Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito
    Vertex-disjoint cycles containing specified vertices in a bipartite graph. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:46, n:3, pp:145-166 [Journal]
  12. Yueping Li, Dingjun Lou
    Finding the ( n , k , 0)-Extendability in Bipartite Graphs and Its Application. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (3), 2007, pp:401-409 [Conf]
  13. Yunting Lu, Dingjun Lou
    An Algorithm to Solve the Partition into Perfect Matchings Problem in Halin Graphs. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (3), 2007, pp:410-418 [Conf]
  14. Dingjun Lou
    On the structure of minimally n-extendable bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:202, n:1-3, pp:173-181 [Journal]
  15. Dingjun Lou
    A local independence number condition for n-extendable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:195, n:1-3, pp:263-268 [Journal]
  16. Robert E. L. Aldred, Bill Jackson, Dingjun Lou, Akira Saito
    Partitioning regular graphs into equicardinal linear forests. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:1, pp:1-9 [Journal]
  17. Derek A. Holton, Dingjun Lou, Michael D. Plummer
    On the 2-extendability of planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:96, n:2, pp:81-99 [Journal]
  18. Dingjun Lou, Derek A. Holton
    Lower bound of cyclic edge connectivity for n-extendability of regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:112, n:1-3, pp:139-150 [Journal]
  19. Dingjun Lou, Qingwei Zhu
    The 2-extendability of strongly regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:148, n:1-3, pp:133-140 [Journal]
  20. Dingjun Lou
    The Chvátal-Erdös condition for cycles in triangle-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:152, n:1-3, pp:253-257 [Journal]

  21. A New Algorithm for Determinating 1-extendable Graphs: Design and Implementation. [Citation Graph (, )][DBLP]


  22. A Linear Algorithm to Find the Maximum-weighted Matching in Halin Graphs. [Citation Graph (, )][DBLP]


  23. Matching Extendability Augmentation in Bipartite Graphs. [Citation Graph (, )][DBLP]


  24. Notes on factor-critically, extendability and independence number. [Citation Graph (, )][DBLP]


  25. Algorithms For The Optimal Hamiltonian Path In Halin Graphs. [Citation Graph (, )][DBLP]


  26. Equivalence between Extendability and Factor-Criticality. [Citation Graph (, )][DBLP]


  27. Characterizing defect n-extendable graphs and (2n+1)-critical graphs. [Citation Graph (, )][DBLP]


  28. Characterizing minimally n-extendable bipartite graphs. [Citation Graph (, )][DBLP]


  29. Characterization of graphs with infinite cyclic edge connectivity. [Citation Graph (, )][DBLP]


  30. M-alternating Hamilton paths and M-alternating Hamilton cycles. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.009secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002