Dingjun Lou

发表

A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs

Dingjun Lou, Zongrong Qin, Qinglin Yu, 2019, J. Comb. Optim..

Matching Extendability Augmentation in Bipartite Graphs

Yueping Li, Dingjun Lou, 2007, IMECS.

Lower bound of cyclic edge connectivity for n-extendability of regular graphs

Dingjun Lou, Derek A. Holton, D. Holton, 1993, Discret. Math..

Characterizing factor critical graphs and an algorithm

Dingjun Lou, Dongning Rao, 2004, Australas. J Comb..

Graphs with no M-alternating paths between two vertices: An update

Dingjun Lou, 2010, Discret. Math..

A New Algorithm for Determinating 1-extendable Graphs: Design and Implementation

Yueping Li, Dingjun Lou, 2007, IMECS.

A Square Time Algorithm for Cyclic Edge Connectivity of Planar Graphs

Dingjun Lou, 2017, Ars Comb..

Some conditions for n-extendable graphs

Dingjun Lou, 1994, Australas. J Comb..

Sufficient conditions for n-matchable graphs

Dingjun Lou, Qinglin Yu, 2004, Australas. J Comb..

Characterizing minimally n-extendable bipartite graphs

Dingjun Lou, Dingjun Lou, 2008, Discret. Math..

Partitioning regular graphs into equicardinal linear forests

Dingjun Lou, Bill Jackson, Akira Saito, 1991, Discret. Math..

Characterizing defect n-extendable graphs and (2n+1)-critical graphs

Dingjun Lou, Xuelian Wen, 2008, Discret. Math..

A neighbourhood union condition for pancyclicity

Bolian Liu, Dingjun Lou, Kewen Zhao, 1995, Australas. J Comb..

An Improved Algorithm for Cyclic Edge Connectivity of Regular Graphs

Dingjun Lou, Kangqi Liang, 2014, Ars Comb..

A Linear Algorithm to Find the Maximum-weighted Matching in Halin Graphs

Yueping Li, Dingjun Lou, Yunting Lu, 2007, IMECS.

A polynomial algorithm determining cyclic vertex connectivity of k-regular graphs with fixed k

Jun Liang, Dingjun Lou, 2019, J. Comb. Optim..

A note on internally disjoint alternating paths in bipartite graphs

Dingjun Lou, Akira Saito, Lihua Teng, 2005, Discret. Math..

On matchability of graphs

Dingjun Lou, 2000, Australas. J Comb..

N-extendability of Line Graphs, Power Graphs, and Total Graphs

Dingjun Lou, Derek A. Holton, K. L. McAvaney, 1995, Australas. J Comb..

Algorithms For The Optimal Hamiltonian Path In Halin Graphs

Yueping Li, Dingjun Lou, Yunting Lu, 2008, Ars Comb..

A local neighbourhood condition for n-extendable graphs

Dingjun Lou, 1996, Australas. J Comb..

Vertex-disjoint cycles containing specified edges in a bipartite graph

Ken-ichi Kawarabayashi, Dingjun Lou, Hikoe Enomoto, 2001, Australas. J Comb..

To Determine 1-Extendable Graphs and its Algorithm

Dingjun Lou, Akira Saito, Lihua Teng, 2003, Ars Comb..

M-alternating paths in n-extendable bipartite graphs

Dingjun Lou, Akira Saito, Robert E. L. Aldred, 2003, Discret. Math..

Notes on factor-critically, extendability and independence number

Dingjun Lou, Xiaoyan Zhang, Zan-Bo Zhang, 2008, Ars Comb..

N-extendability of symmetric graphs

Dingjun Lou, Robert E. L. Aldred, Derek A. Holton, 1993, J. Graph Theory.

On the 2-extendability of planar graphs

Dingjun Lou, Michael D. Plummer, Derek A. Holton, 1991, Discret. Math..

Finding the ( n , k , 0)-Extendability in Bipartite Graphs and Its Application

Yueping Li, Dingjun Lou, 2007, International Conference on Computational Science.

The 2-extendability of strongly regular graphs

Dingjun Lou, Qingwei Zhu, 1996, Discret. Math..

A local independence number condition for n-extendable graphs

Dingjun Lou, 1999, Discret. Math..

Characterization of k-subconnected graphs

Dingjun Lou, Zongrong Qin, Huiquan Zhu, 2020, Appl. Math. Comput..

The Chvátal-Erdös condition for cycles in triangle-free graphs

Dingjun Lou, 1996, Discret. Math..

Vertex‐disjoint cycles containing specified vertices in a bipartite graph

Ken-ichi Kawarabayashi, Dingjun Lou, Hikoe Enomoto, 2004, J. Graph Theory.

A Highly Efficient Algorithm to Determine Bicritical Graphs

Dingjun Lou, Ning Zhong, 2001, COCOON.

Characterizing 2k-critical graphs and n-extendable graphs

Dingjun Lou, Ning Zhong, Robert E. L. Aldred, 2004, Discret. Math..

Minimum Size of n-Factor-Critical Graphs and k-Extendable Graphs

Dingjun Lou, Xiaoyan Zhang, Zan-Bo Zhang, 2011, Graphs and Combinatorics.

Characterization of graphs with infinite cyclic edge connectivity

Dingjun Lou, Wei Wang, Wei Wang, 2008, Discret. Math..

Hamilton Cycles in n-Extendable Bipartite Graphs

Yueping Li, Dingjun Lou, 2018, Ars Comb..

Panconnectedness of K-trees with Sufficiently Large Toughness

Dingjun Lou, Rongsheng Zhao, 2017, Ars Comb..

A polynomial algorithm for cyclic edge connectivity of cubic graphs

Dingjun Lou, Xiangjun Wu, Lihua Teng, 2001, Australas. J Comb..

A polynomial time algorithm for cyclic vertex connectivity of cubic graphs

Jun Liang, Dingjun Lou, Zan-Bo Zhang, 2017, Int. J. Comput. Math..

Connectivity of k-extendable graphs with large k

Dingjun Lou, Qinglin Yu, 2004, Discret. Appl. Math..

Equivalence between Extendability and Factor-Criticality

Dingjun Lou, Tao Wang, Zan-Bo Zhang, 2007, Ars Comb..

A Local Neighbourhood Condition for Cycles

Dingjun Lou, 1997, Ars Comb..

Graphs with no M-alternating path between two vertices

Dingjun Lou, Dongning Rao, 2004, Discret. Math..

M-alternating paths and the construction of defect n-extendable bipartite graphs with different connectivities

Dingjun Lou, Zan-Bo Zhang, Xuelian Wen, 2011, Discret. Math..

M-alternating Hamilton paths and M-alternating Hamilton cycles

Yueping Li, Dingjun Lou, Zan-Bo Zhang, 2009, Discret. Math..

Path decomposition of defect 1-extendable bipartite graphs

Dingjun Lou, Xuelian Wen, Dingjun Lou, 2007, Australas. J Comb..

Characterizing defect n-extendable bipartite graphs with different connectivities

Dingjun Lou, Xuelian Wen, 2007, Discret. Math..

On the structure of minimally n-extendable bipartite graphs

Dingjun Lou, Dingjun Lou, 1999, Discret. Math..

Matching extensions of strongly regular graphs

Dingjun Lou, Derek A. Holton, 1992, Australas. J Comb..

An Efficient Algorithm for Cyclic Edge Connectivity of Regular Graphs

Dingjun Lou, Wei Wang, Wei Wang, 2005, Ars Comb..

A note on max-leaves spanning tree problem in Halin graphs

Dingjun Lou, Huiquan Zhu, 2004, Australas. J Comb..

An Algorithm to Solve the Partition into Perfect Matchings Problem in Halin Graphs

Dingjun Lou, Yunting Lu, 2007, International Conference on Computational Science.

An Algorithm to Find the Optimal Matching in Halin Graphs

Yueping Li, Dingjun Lou, Yunting Lu, .