# Dingjun Lou

According to our database

Collaborative distances:

^{1}, Dingjun Lou authored at least 63 papers between 1991 and 2024.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2024

Discret. Appl. Math., 2024

2022

Conformance Between Choreography and Collaboration in BPMN Involving Multi-Instance Participants.

Int. J. Pattern Recognit. Artif. Intell., 2022

2021

Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments.

J. Graph Theory, 2021

Discret. Math., 2021

Proceedings of the Computer Supported Cooperative Work and Social Computing, 2021

2020

Hamiltonian Cycle Properties in k-Extendable Non-bipartite Graphs with High Connectivity.

Graphs Comb., 2020

Appl. Math. Comput., 2020

IEEE Access, 2020

2019

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

J. Comb. Optim., 2019

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

J. Comb. Optim., 2019

2018

Hamilton Cycles in n-Extendable Bipartite Graphs.

Ars Comb., 2018

2017

SIAM J. Discret. Math., 2017

Int. J. Comput. Math., 2017

Panconnectedness of K-trees with Sufficiently Large Toughness.

Ars Comb., 2017

A Square Time Algorithm for Cyclic Edge Connectivity of Planar Graphs.

Ars Comb., 2017

2014

An Improved Algorithm for Cyclic Edge Connectivity of Regular Graphs.

Ars Comb., 2014

2012

Graphs Comb., 2012

2011

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

Discret. Math., 2011

2010

Int. J. Comput. Math., 2010

Discret. Math., 2010

2009

Discret. Math., 2009

2008

Discret. Math., 2008

Discret. Math., 2008

Discret. Math., 2008

Notes on factor-critically, extendability and independence number.

Ars Comb., 2008

Algorithms For The Optimal Hamiltonian Path In Halin Graphs.

Ars Comb., 2008

2007

Characterizing defect n-extendable bipartite graphs with different connectivities.

Discret. Math., 2007

Equivalence between Extendability and Factor-Criticality.

Ars Comb., 2007

Australas. J Comb., 2007

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

Proceedings of the International MultiConference of Engineers and Computer Scientists 2007, 2007

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

Proceedings of the International MultiConference of Engineers and Computer Scientists 2007, 2007

Matching Extendability Augmentation in Bipartite Graphs.

Proceedings of the International MultiConference of Engineers and Computer Scientists 2007, 2007

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

Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

Finding the ( <i>n</i> , <i>k</i> , 0)-Extendability in Bipartite Graphs and Its Application.

Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

2005

Discret. Math., 2005

An Efficient Algorithm for Cyclic Edge Connectivity of Regular Graphs.

Ars Comb., 2005

2004

J. Graph Theory, 2004

Discret. Math., 2004

Discret. Math., 2004

Discret. Appl. Math., 2004

Australas. J Comb., 2004

Australas. J Comb., 2004

Australas. J Comb., 2004

2003

Discret. Math., 2003

To Determine 1-Extendable Graphs and its Algorithm.

Ars Comb., 2003

2001

Australas. J Comb., 2001

Australas. J Comb., 2001

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

Australas. J Comb., 2000

1999

Discret. Math., 1999

Discret. Math., 1999

1997

A Local Neighbourhood Condition for Cycles.

Ars Comb., 1997

1996

Discret. Math., 1996

Discret. Math., 1996

Australas. J Comb., 1996

1995

Australas. J Comb., 1995

Australas. J Comb., 1995

1994

Australas. J Comb., 1994

1993

J. Graph Theory, 1993

Discret. Math., 1993

1992

Australas. J Comb., 1992

1991

Discret. Math., 1991

Discret. Math., 1991