Dingjun Lou

Publication Activity (10 Years)

Years Active: 1991-2022
Publications (10 Years): 13

Top Topics

Maximum Cardinality

Business Process

Bipartite Graph

Top Venues

J. Comb. Optim.

Int. J. Pattern Recognit. Artif. Intell.

Appl. Math. Comput.

Publications

Tianhong Xiong, Maolin Pan, Yang Yu, Dingjun Lou
Conformance Between Choreography and Collaboration in BPMN Involving Multi-Instance Participants. Int. J. Pattern Recognit. Artif. Intell. 36 (7) (2022)
Jun Liang, Dingjun Lou, Zan-Bo Zhang
The cubic graphs with finite cyclic vertex connectivity larger than girth. Discret. Math. 344 (2) (2021)
Zan-Bo Zhang, Xiaoyan Zhang, Gregory Z. Gutin, Dingjun Lou
Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments. J. Graph Theory 96 (2) (2021)
Zhiyong Gan, Dingjun Lou, Yanping Xu
Hamiltonian Cycle Properties in k-Extendable Non-bipartite Graphs with High Connectivity. Graphs Comb. 36 (4) (2020)
Tianhong Xiong, Maolin Pan, Yang Yu, Dingjun Lou
Detecting Data Flow Errors Across Processes in Business Process Collaboration. IEEE Access 8 (2020)
Zongrong Qin, Dingjun Lou, Huiquan Zhu, Jun Liang
-subconnected graphs. Appl. Math. Comput. 364 (2020)
Jun Liang, Dingjun Lou
A polynomial algorithm determining cyclic vertex connectivity of k-regular graphs with fixed k. J. Comb. Optim. 37 (3) (2019)
Jun Liang, Dingjun Lou, Zongrong Qin, Qinglin Yu
A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs. J. Comb. Optim. 38 (2) (2019)
Yueping Li, Dingjun Lou
Hamilton Cycles in n-Extendable Bipartite Graphs. Ars Comb. 139 (2018)
Jun Liang, Dingjun Lou, Zan-Bo Zhang
A polynomial time algorithm for cyclic vertex connectivity of cubic graphs. Int. J. Comput. Math. 94 (7) (2017)
Dingjun Lou, Rongsheng Zhao
Panconnectedness of K-trees with Sufficiently Large Toughness. Ars Comb. 130 (2017)
Dingjun Lou
A Square Time Algorithm for Cyclic Edge Connectivity of Planar Graphs. Ars Comb. 133 (2017)
Zan-Bo Zhang, Xiaoyan Zhang, Hajo Broersma, Dingjun Lou
Extremal and Degree Conditions for Path Extendability in Digraphs. SIAM J. Discret. Math. 31 (3) (2017)
Dingjun Lou, Kangqi Liang
An Improved Algorithm for Cyclic Edge Connectivity of Regular Graphs. Ars Comb. 115 (2014)
Zan-Bo Zhang, Xiaoyan Zhang, Dingjun Lou, Xuelian Wen
Minimum Size of n-Factor-Critical Graphs and k-Extendable Graphs. Graphs Comb. 28 (3) (2012)
Xuelian Wen, Zan-Bo Zhang, Dingjun Lou
M-alternating paths and the construction of defect n-extendable bipartite graphs with different connectivities. Discret. Math. 311 (10-11) (2011)
Dingjun Lou
Graphs with no M-alternating paths between two vertices: An update. Discret. Math. 310 (23) (2010)
Yueping Li, Dingjun Lou, Yunting Lu
constrains. Int. J. Comput. Math. 87 (8) (2010)
Zan-Bo Zhang, Yueping Li, Dingjun Lou
M-alternating Hamilton paths and M-alternating Hamilton cycles. Discret. Math. 309 (10) (2009)
Dingjun Lou
Characterizing minimally n-extendable bipartite graphs. Discret. Math. 308 (11) (2008)
Zan-Bo Zhang, Dingjun Lou, Xiaoyan Zhang
Notes on factor-critically, extendability and independence number. Ars Comb. 87 (2008)
Yueping Li, Dingjun Lou, Yunting Lu
Algorithms For The Optimal Hamiltonian Path In Halin Graphs. Ars Comb. 87 (2008)
Xuelian Wen, Dingjun Lou
Characterizing defect n-extendable graphs and (2n+1)-critical graphs. Discret. Math. 308 (22) (2008)
Dingjun Lou, Wei Wang
Characterization of graphs with infinite cyclic edge connectivity. Discret. Math. 308 (11) (2008)
Xuelian Wen, Dingjun Lou
Path decomposition of defect 1-extendable bipartite graphs. Australas. J Comb. 39 (2007)
Yueping Li, Dingjun Lou
, 0)-Extendability in Bipartite Graphs and Its Application. International Conference on Computational Science (3) (2007)
Yueping Li, Dingjun Lou
Matching Extendability Augmentation in Bipartite Graphs. IMECS (2007)
Zan-Bo Zhang, Tao Wang, Dingjun Lou
Equivalence between Extendability and Factor-Criticality. Ars Comb. 85 (2007)
Yunting Lu, Yueping Li, Dingjun Lou
A Linear Algorithm to Find the Maximum-weighted Matching in Halin Graphs. IMECS (2007)
Xuelian Wen, Dingjun Lou
Characterizing defect n-extendable bipartite graphs with different connectivities. Discret. Math. 307 (15) (2007)
Yunting Lu, Dingjun Lou
An Algorithm to Solve the Partition into Perfect Matchings Problem in Halin Graphs. International Conference on Computational Science (3) (2007)
Yueping Li, Dingjun Lou
A New Algorithm for Determinating 1-extendable Graphs: Design and Implementation. IMECS (2007)
Dingjun Lou, Wei Wang
An Efficient Algorithm for Cyclic Edge Connectivity of Regular Graphs. Ars Comb. 77 (2005)
Dingjun Lou, Akira Saito, Lihua Teng
A note on internally disjoint alternating paths in bipartite graphs. Discret. Math. 290 (1) (2005)
Dingjun Lou, Dongning Rao
Characterizing factor critical graphs and an algorithm. Australas. J Comb. 30 (2004)
Dingjun Lou, Dongning Rao
Graphs with no M-alternating path between two vertices. Discret. Math. 280 (1-3) (2004)
Dingjun Lou, Qinglin Yu
Sufficient conditions for n-matchable graphs. Australas. J Comb. 29 (2004)
Dingjun Lou, Qinglin Yu
Connectivity of k-extendable graphs with large k. Discret. Appl. Math. 136 (1) (2004)
Dingjun Lou, Huiquan Zhu
A note on max-leaves spanning tree problem in Halin graphs. Australas. J Comb. 29 (2004)
Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito
Vertex-disjoint cycles containing specified vertices in a bipartite graph. J. Graph Theory 46 (3) (2004)
Robert E. L. Aldred, Derek A. Holton, Dingjun Lou, Ning Zhong
-extendable graphs. Discret. Math. 287 (1-3) (2004)
Robert E. L. Aldred, Derek A. Holton, Dingjun Lou, Akira Saito
-extendable bipartite graphs. Discret. Math. 269 (1-3) (2003)
Dingjun Lou, Akira Saito, Lihua Teng
To Determine 1-Extendable Graphs and its Algorithm. Ars Comb. 69 (2003)
Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito
Vertex-disjoint cycles containing specified edges in a bipartite graph. Australas. J Comb. 23 (2001)
Dingjun Lou, Lihua Teng, Xiangjun Wu
A polynomial algorithm for cyclic edge connectivity of cubic graphs. Australas. J Comb. 24 (2001)
Dingjun Lou, Ning Zhong
A Highly Efficient Algorithm to Determine Bicritical Graphs. COCOON (2001)
Dingjun Lou
On matchability of graphs. Australas. J Comb. 21 (2000)
Dingjun Lou
A local independence number condition for n-extendable graphs. Discret. Math. 195 (1-3) (1999)
Dingjun Lou
On the structure of minimally n-extendable bipartite graphs. Discret. Math. 202 (1-3) (1999)
Dingjun Lou
A Local Neighbourhood Condition for Cycles. Ars Comb. 45 (1997)
Dingjun Lou
A local neighbourhood condition for n-extendable graphs. Australas. J Comb. 14 (1996)
Dingjun Lou, Qingwei Zhu
The 2-extendability of strongly regular graphs. Discret. Math. 148 (1-3) (1996)
Dingjun Lou
The Chvátal-Erdös condition for cycles in triangle-free graphs. Discret. Math. 152 (1-3) (1996)
Bolian Liu, Dingjun Lou, Kewen Zhao
A neighbourhood union condition for pancyclicity. Australas. J Comb. 12 (1995)
Derek A. Holton, Dingjun Lou, K. L. McAvaney
n-extendability of line graphs, power graphs, and total graphs. Australas. J Comb. 11 (1995)
Dingjun Lou
Some conditions for n-extendable graphs. Australas. J Comb. 9 (1994)
Dingjun Lou, Derek A. Holton
Lower bound of cyclic edge connectivity for n-extendability of regular graphs. Discret. Math. 112 (1-3) (1993)
Robert E. L. Aldred, Derek A. Holton, Dingjun Lou
N-extendability of symmetric graphs. J. Graph Theory 17 (2) (1993)
Derek A. Holton, Dingjun Lou
Matching extensions of strongly regular graphs. Australas. J Comb. 6 (1992)
Robert E. L. Aldred, Bill Jackson, Dingjun Lou, Akira Saito
Partitioning regular graphs into equicardinal linear forests. Discret. Math. 88 (1) (1991)
Derek A. Holton, Dingjun Lou, Michael D. Plummer
On the 2-extendability of planar graphs. Discret. Math. 96 (2) (1991)