Dingjun Lou

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