Partitioning regular graphs into equicardinal linear forests. - Robert E. L. Aldred; Bill Jackson; Dingjun Lou; Akira Saito (Discret. Math., 1991)

On the 2-extendability of planar graphs. - Derek A. Holton; Dingjun Lou; Michael D. Plummer (Discret. Math., 1991)

Matching extensions of strongly regular graphs. - Derek A. Holton; Dingjun Lou (Australas. J Comb., 1992)

Lower bound of cyclic edge connectivity for n-extendability of regular graphs. - Dingjun Lou; Derek A. Holton (Discret. Math., 1993)

N-extendability of symmetric graphs. - Robert E. L. Aldred; Derek A. Holton; Dingjun Lou (J. Graph Theory, 1993)

Some conditions for n-extendable graphs. - Dingjun Lou (Australas. J Comb., 1994)

n-extendability of line graphs, power graphs, and total graphs. - Derek A. Holton; Dingjun Lou; K. L. McAvaney (Australas. J Comb., 1995)

A neighbourhood union condition for pancyclicity. - Bolian Liu; Dingjun Lou; Kewen Zhao (Australas. J Comb., 1995)

A local neighbourhood condition for n-extendable graphs. - Dingjun Lou (Australas. J Comb., 1996)

The Chvátal-Erdös condition for cycles in triangle-free graphs. - Dingjun Lou (Discret. Math., 1996)

The 2-extendability of strongly regular graphs. - Dingjun Lou; Qingwei Zhu (Discret. Math., 1996)

A Local Neighbourhood Condition for Cycles. - Dingjun Lou (Ars Comb., 1997)

On the structure of minimally n-extendable bipartite graphs. - Dingjun Lou (Discret. Math., 1999)

A local independence number condition for n-extendable graphs. - Dingjun Lou (Discret. Math., 1999)

On matchability of graphs. - Dingjun Lou (Australas. J Comb., 2000)

A Highly Efficient Algorithm to Determine Bicritical Graphs. - Dingjun Lou; Ning Zhong (COCOON, 2001)

Vertex-disjoint cycles containing specified edges in a bipartite graph. - Guantao Chen; Hikoe Enomoto; Ken-ichi Kawarabayashi; Katsuhiro Ota; Dingjun Lou; Akira Saito (Australas. J Comb., 2001)

A polynomial algorithm for cyclic edge connectivity of cubic graphs. - Dingjun Lou; Lihua Teng; Xiangjun Wu (Australas. J Comb., 2001)

To Determine 1-Extendable Graphs and its Algorithm. - Dingjun Lou; Akira Saito; Lihua Teng (Ars Comb., 2003)

M-alternating paths in n-extendable bipartite graphs. - Robert E. L. Aldred; Derek A. Holton; Dingjun Lou; Akira Saito (Discret. Math., 2003)

Characterizing factor critical graphs and an algorithm. - Dingjun Lou; Dongning Rao (Australas. J Comb., 2004)

Sufficient conditions for n-matchable graphs. - Dingjun Lou; Qinglin Yu (Australas. J Comb., 2004)

A note on max-leaves spanning tree problem in Halin graphs. - Dingjun Lou; Huiquan Zhu (Australas. J Comb., 2004)

Connectivity of k-extendable graphs with large k. - Dingjun Lou; Qinglin Yu (Discret. Appl. Math., 2004)

Characterizing 2k-critical graphs and n-extendable graphs. - Robert E. L. Aldred; Derek A. Holton; Dingjun Lou; Ning Zhong (Discret. Math., 2004)

Graphs with no M-alternating path between two vertices. - Dingjun Lou; Dongning Rao (Discret. Math., 2004)

Vertex-disjoint cycles containing specified vertices in a bipartite graph. - Guantao Chen; Hikoe Enomoto; Ken-ichi Kawarabayashi; Katsuhiro Ota; Dingjun Lou; Akira Saito (J. Graph Theory, 2004)

An Efficient Algorithm for Cyclic Edge Connectivity of Regular Graphs. - Dingjun Lou; Wei Wang (Ars Comb., 2005)

A note on internally disjoint alternating paths in bipartite graphs. - Dingjun Lou; Akira Saito; Lihua Teng (Discret. Math., 2005)

Finding the ( n , k , 0)-Extendability in Bipartite Graphs and Its Application. - Yueping Li; Dingjun Lou (International Conference on Computational Science (3), 2007)

An Algorithm to Solve the Partition into Perfect Matchings Problem in Halin Graphs. - Yunting Lu; Dingjun Lou (International Conference on Computational Science (3), 2007)

Matching Extendability Augmentation in Bipartite Graphs. - Yueping Li; Dingjun Lou (IMECS, 2007)

A New Algorithm for Determinating 1-extendable Graphs: Design and Implementation. - Yueping Li; Dingjun Lou (IMECS, 2007)

A Linear Algorithm to Find the Maximum-weighted Matching in Halin Graphs. - Yunting Lu; Yueping Li; Dingjun Lou (IMECS, 2007)

Path decomposition of defect 1-extendable bipartite graphs. - Xuelian Wen; Dingjun Lou (Australas. J Comb., 2007)

Equivalence between Extendability and Factor-Criticality. - Zan-Bo Zhang; Tao Wang; Dingjun Lou (Ars Comb., 2007)

Characterizing defect n-extendable bipartite graphs with different connectivities. - Xuelian Wen; Dingjun Lou (Discret. Math., 2007)

Algorithms For The Optimal Hamiltonian Path In Halin Graphs. - Yueping Li; Dingjun Lou; Yunting Lu (Ars Comb., 2008)

Notes on factor-critically, extendability and independence number. - Zan-Bo Zhang; Dingjun Lou; Xiaoyan Zhang 001 (Ars Comb., 2008)

Characterizing minimally n-extendable bipartite graphs. - Dingjun Lou (Discret. Math., 2008)

Characterization of graphs with infinite cyclic edge connectivity. - Dingjun Lou; Wei Wang (Discret. Math., 2008)

Characterizing defect n-extendable graphs and (2n+1)-critical graphs. - Xuelian Wen; Dingjun Lou (Discret. Math., 2008)

M-alternating Hamilton paths and M-alternating Hamilton cycles. - Zan-Bo Zhang; Yueping Li; Dingjun Lou (Discret. Math., 2009)

Graphs with no M-alternating paths between two vertices: An update. - Dingjun Lou (Discret. Math., 2010)

Algorithms for (0, 1, d)-graphs with d constrains. - Yueping Li; Dingjun Lou; Yunting Lu (Int. J. Comput. Math., 2010)

M-alternating paths and the construction of defect n-extendable bipartite graphs with different connectivities. - Xuelian Wen; Zan-Bo Zhang; Dingjun Lou (Discret. Math., 2011)

Minimum Size of n-Factor-Critical Graphs and k-Extendable Graphs. - Zan-Bo Zhang; Xiaoyan Zhang 001; Dingjun Lou; Xuelian Wen (Graphs Comb., 2012)

An Improved Algorithm for Cyclic Edge Connectivity of Regular Graphs. - Dingjun Lou; Kangqi Liang (Ars Comb., 2014)

A Square Time Algorithm for Cyclic Edge Connectivity of Planar Graphs. - Dingjun Lou (Ars Comb., 2017)

Panconnectedness of K-trees with Sufficiently Large Toughness. - Dingjun Lou; Rongsheng Zhao (Ars Comb., 2017)

A polynomial time algorithm for cyclic vertex connectivity of cubic graphs. - Jun Liang 002; Dingjun Lou; Zan-Bo Zhang (Int. J. Comput. Math., 2017)

Extremal and Degree Conditions for Path Extendability in Digraphs. - Zan-Bo Zhang; Xiaoyan Zhang 001; Hajo Broersma; Dingjun Lou (SIAM J. Discret. Math., 2017)

Hamilton Cycles in n-Extendable Bipartite Graphs. - Yueping Li; Dingjun Lou (Ars Comb., 2018)

A polynomial algorithm determining cyclic vertex connectivity of k-regular graphs with fixed k. - Jun Liang 002; Dingjun Lou (J. Comb. Optim., 2019)

A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs. - Jun Liang 002; Dingjun Lou; Zongrong Qin; Qinglin Yu (J. Comb. Optim., 2019)

Detecting Data Flow Errors Across Processes in Business Process Collaboration. - Tianhong Xiong; Maolin Pan; Yang Yu 027; Dingjun Lou (IEEE Access, 2020)

Characterization of k-subconnected graphs. - Zongrong Qin; Dingjun Lou; Huiquan Zhu; Jun Liang 002 (Appl. Math. Comput., 2020)

Hamiltonian Cycle Properties in k-Extendable Non-bipartite Graphs with High Connectivity. - Zhiyong Gan; Dingjun Lou; Yanping Xu (Graphs Comb., 2020)

Research on Temporal Workflow Task Assignment Strategy. - Tianhong Xiong; Yang Xu; Yang Yu 027; Dingjun Lou (ChineseCSCW (1), 2021)

The cubic graphs with finite cyclic vertex connectivity larger than girth. - Jun Liang 002; Dingjun Lou; Zan-Bo Zhang (Discret. Math., 2021)

Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments. - Zan-Bo Zhang; Xiaoyan Zhang 001; Gregory Z. Gutin; Dingjun Lou (J. Graph Theory, 2021)

Conformance Between Choreography and Collaboration in BPMN Involving Multi-Instance Participants. - Tianhong Xiong; Maolin Pan; Yang Yu 027; Dingjun Lou (Int. J. Pattern Recognit. Artif. Intell., 2022)

Cyclic edge and cyclic vertex connectivity of (4,5,6)-fullerene graphs. - Jun Liang 002; Xinyao Liu; Dingjun Lou; Zan-Bo Zhang; Zixin Qin (Discret. Appl. Math., 2024)