The SCEAS System
| |||||||

## Search the dblp DataBase
Dingjun Lou:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Dingjun Lou, Ning Zhong
**A Highly Efficient Algorithm to Determine Bicritical Graphs.**[Citation Graph (0, 0)][DBLP] COCOON, 2001, pp:349-356 [Conf] - Dingjun Lou
**A Local Neighbourhood Condition for Cycles.**[Citation Graph (0, 0)][DBLP] Ars Comb., 1997, v:45, n:, pp:- [Journal] - 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] - 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] - 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] - Robert E. L. Aldred, Derek A. Holton, Dingjun Lou, Akira Saito
[Citation Graph (0, 0)][DBLP]*M*-alternating paths in*n*-extendable bipartite graphs. Discrete Mathematics, 2003, v:269, n:1-3, pp:1-11 [Journal] - Robert E. L. Aldred, Derek A. Holton, Dingjun Lou, Ning Zhong
**Characterizing 2**[Citation Graph (0, 0)][DBLP]*k*-critical graphs and*n*-extendable graphs. Discrete Mathematics, 2004, v:287, n:1-3, pp:135-139 [Journal] - 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] - 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] - 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] - 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] - Yueping Li, Dingjun Lou
**Finding the (**[Citation Graph (0, 0)][DBLP]*n*,*k*, 0)-Extendability in Bipartite Graphs and Its Application. International Conference on Computational Science (3), 2007, pp:401-409 [Conf] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] **A New Algorithm for Determinating 1-extendable Graphs: Design and Implementation.**[Citation Graph (, )][DBLP]**A Linear Algorithm to Find the Maximum-weighted Matching in Halin Graphs.**[Citation Graph (, )][DBLP]**Matching Extendability Augmentation in Bipartite Graphs.**[Citation Graph (, )][DBLP]**Notes on factor-critically, extendability and independence number.**[Citation Graph (, )][DBLP]**Algorithms For The Optimal Hamiltonian Path In Halin Graphs.**[Citation Graph (, )][DBLP]**Equivalence between Extendability and Factor-Criticality.**[Citation Graph (, )][DBLP]**Characterizing defect n-extendable graphs and (2n+1)-critical graphs.**[Citation Graph (, )][DBLP]**Characterizing minimally n-extendable bipartite graphs.**[Citation Graph (, )][DBLP]**Characterization of graphs with infinite cyclic edge connectivity.**[Citation Graph (, )][DBLP]**M-alternating Hamilton paths and M-alternating Hamilton cycles.**[Citation Graph (, )][DBLP]
Search in 0.018secs, Finished in 0.019secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |