 | 2012 |
|---|
| 34 |       | Zan-Bo Zhang,
Xiaoyan Zhang,
Dingjun Lou,
Xuelian Wen:
Minimum Size of n-Factor-Critical Graphs and k-Extendable Graphs.
Graphs and Combinatorics 28(3): 433-448 (2012) |
| 2011 |
|---|
| 33 | | Xuelian Wen,
Zan-Bo Zhang,
Dingjun Lou:
M-alternating paths and the construction of defect n-extendable bipartite graphs with different connectivities.
Discrete Mathematics 311(10-11): 817-826 (2011) |
| 2010 |
|---|
| 32 | | Dingjun Lou:
Graphs with no M-alternating paths between two vertices: An update.
Discrete Mathematics 310(23): 3429-3431 (2010) |
| 31 | | Yueping Li,
Dingjun Lou,
Yunting Lu:
Algorithms for (0, 1, d)-graphs with d constrains.
Int. J. Comput. Math. 87(8): 1680-1691 (2010) |
| 2009 |
|---|
| 30 | | Zan-Bo Zhang,
Yueping Li,
Dingjun Lou:
M-alternating Hamilton paths and M-alternating Hamilton cycles.
Discrete Mathematics 309(10): 3385-3392 (2009) |
| 2008 |
|---|
| 29 |  | Yueping Li,
Dingjun Lou,
Yunting Lu:
Algorithms For The Optimal Hamiltonian Path In Halin Graphs.
Ars Comb. 87: (2008) |
| 28 | | Zan-Bo Zhang,
Dingjun Lou,
Xiaoyan Zhang:
Notes on factor-critically, extendability and independence number.
Ars Comb. 87: (2008) |
| 27 | | Dingjun Lou,
Wei Wang:
Characterization of graphs with infinite cyclic edge connectivity.
Discrete Mathematics 308(11): 2094-2103 (2008) |
| 26 | | Dingjun Lou:
Characterizing minimally n-extendable bipartite graphs.
Discrete Mathematics 308(11): 2269-2272 (2008) |
| 25 | | Xuelian Wen,
Dingjun Lou:
Characterizing defect n-extendable graphs and (2n+1)-critical graphs.
Discrete Mathematics 308(22): 5064-5069 (2008) |
| 2007 |
|---|
| 24 | | Yunting Lu,
Yueping Li,
Dingjun Lou:
A Linear Algorithm to Find the Maximum-weighted Matching in Halin Graphs.
IMECS 2007: 2274-2278 |
| 23 | | Yueping Li,
Dingjun Lou:
Matching Extendability Augmentation in Bipartite Graphs.
IMECS 2007: 2291-2296 |
| 22 | | Yueping Li,
Dingjun Lou:
A New Algorithm for Determinating 1-extendable Graphs: Design and Implementation.
IMECS 2007: 2327-2332 |
| 21 | | Yueping Li,
Dingjun Lou:
Finding the ( n , k , 0)-Extendability in Bipartite Graphs and Its Application.
International Conference on Computational Science (3) 2007: 401-409 |
| 20 | | Yunting Lu,
Dingjun Lou:
An Algorithm to Solve the Partition into Perfect Matchings Problem in Halin Graphs.
International Conference on Computational Science (3) 2007: 410-418 |
| 19 | | Zan-Bo Zhang,
Tao Wang,
Dingjun Lou:
Equivalence between Extendability and Factor-Criticality.
Ars Comb. 85: (2007) |
| 18 | | Xuelian Wen,
Dingjun Lou:
Characterizing defect n-extendable bipartite graphs with different connectivities.
Discrete Mathematics 307(15): 1898-1908 (2007) |
| 2005 |
|---|
| 17 | | Dingjun Lou,
Wei Wang:
An Efficient Algorithm for Cyclic Edge Connectivity of Regular Graphs.
Ars Comb. 77: (2005) |
| 16 | | Dingjun Lou,
Akira Saito,
Lihua Teng:
A note on internally disjoint alternating paths in bipartite graphs.
Discrete Mathematics 290(1): 105-108 (2005) |
| 2004 |
|---|
| 15 | | Dingjun Lou,
Qinglin Yu:
Connectivity of k-extendable graphs with large k.
Discrete Applied Mathematics 136(1): 55-61 (2004) |
| 14 | | Dingjun Lou,
Dongning Rao:
Graphs with no M-alternating path between two vertices.
Discrete Mathematics 280(1-3): 237-240 (2004) |
| 13 | | Robert E. L. Aldred,
Derek A. Holton,
Dingjun Lou,
Ning Zhong:
Characterizing 2k-critical graphs and n-extendable graphs.
Discrete Mathematics 287(1-3): 135-139 (2004) |
| 12 | | Guantao Chen,
Hikoe Enomoto,
Ken-ichi Kawarabayashi,
Katsuhiro Ota,
Dingjun Lou,
Akira Saito:
Vertex-disjoint cycles containing specified vertices in a bipartite graph.
Journal of Graph Theory 46(3): 145-166 (2004) |
| 2003 |
|---|
| 11 | | Dingjun Lou,
Akira Saito,
Lihua Teng:
To Determine 1-Extendable Graphs and its Algorithm.
Ars Comb. 69: (2003) |
| 10 | | Robert E. L. Aldred,
Derek A. Holton,
Dingjun Lou,
Akira Saito:
M-alternating paths in n-extendable bipartite graphs.
Discrete Mathematics 269(1-3): 1-11 (2003) |
| 2001 |
|---|
| 9 | | Dingjun Lou,
Ning Zhong:
A Highly Efficient Algorithm to Determine Bicritical Graphs.
COCOON 2001: 349-356 |
| 1999 |
|---|
| 8 | | Dingjun Lou:
A local independence number condition for n-extendable graphs.
Discrete Mathematics 195(1-3): 263-268 (1999) |
| 7 | | Dingjun Lou:
On the structure of minimally n-extendable bipartite graphs.
Discrete Mathematics 202(1-3): 173-181 (1999) |
| 1997 |
|---|
| 6 | | Dingjun Lou:
A Local Neighbourhood Condition for Cycles.
Ars Comb. 45: (1997) |
| 1996 |
|---|
| 5 | | Dingjun Lou,
Qingwei Zhu:
The 2-extendability of strongly regular graphs.
Discrete Mathematics 148(1-3): 133-140 (1996) |
| 4 | | Dingjun Lou:
The Chvátal-Erdös condition for cycles in triangle-free graphs.
Discrete Mathematics 152(1-3): 253-257 (1996) |
| 1993 |
|---|
| 3 | | Dingjun Lou,
Derek A. Holton:
Lower bound of cyclic edge connectivity for n-extendability of regular graphs.
Discrete Mathematics 112(1-3): 139-150 (1993) |
| 1991 |
|---|
| 2 | | Robert E. L. Aldred,
Bill Jackson,
Dingjun Lou,
Akira Saito:
Partitioning regular graphs into equicardinal linear forests.
Discrete Mathematics 88(1): 1-9 (1991) |
| 1 | | Derek A. Holton,
Dingjun Lou,
Michael D. Plummer:
On the 2-extendability of planar graphs.
Discrete Mathematics 96(2): 81-99 (1991) |
Data released under the ODC-BY 1.0 license — See also our legal information page