Dingjun Lou

According to our database1, Dingjun Lou authored at least 63 papers between 1991 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Cyclic edge and cyclic vertex connectivity of (4,5,6)-fullerene graphs.
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

The cubic graphs with finite cyclic vertex connectivity larger than girth.
Discret. Math., 2021

Research on Temporal Workflow Task Assignment Strategy.
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

Characterization of <i>k</i>-subconnected graphs.
Appl. Math. Comput., 2020

Detecting Data Flow Errors Across Processes in Business Process Collaboration.
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
Extremal and Degree Conditions for Path Extendability in Digraphs.
SIAM J. Discret. Math., 2017

A polynomial time algorithm for cyclic vertex connectivity of cubic graphs.
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
Minimum Size of n-Factor-Critical Graphs and k-Extendable Graphs.
Graphs Comb., 2012

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

2010
Algorithms for (0, 1, <i>d</i>)-graphs with <i>d</i> constrains.
Int. J. Comput. Math., 2010

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

2009
M-alternating Hamilton paths and M-alternating Hamilton cycles.
Discret. Math., 2009

2008
Characterizing defect n-extendable graphs and (2n+1)-critical graphs.
Discret. Math., 2008

Characterization of graphs with infinite cyclic edge connectivity.
Discret. Math., 2008

Characterizing minimally n-extendable bipartite graphs.
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

Path decomposition of defect 1-extendable bipartite graphs.
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
A note on internally disjoint alternating paths in bipartite graphs.
Discret. Math., 2005

An Efficient Algorithm for Cyclic Edge Connectivity of Regular Graphs.
Ars Comb., 2005

2004
Vertex-disjoint cycles containing specified vertices in a bipartite graph.
J. Graph Theory, 2004

Graphs with no M-alternating path between two vertices.
Discret. Math., 2004

Characterizing 2<i>k</i>-critical graphs and <i>n</i>-extendable graphs.
Discret. Math., 2004

Connectivity of k-extendable graphs with large k.
Discret. Appl. Math., 2004

A note on max-leaves spanning tree problem in Halin graphs.
Australas. J Comb., 2004

Sufficient conditions for n-matchable graphs.
Australas. J Comb., 2004

Characterizing factor critical graphs and an algorithm.
Australas. J Comb., 2004

2003
<i>M</i>-alternating paths in <i>n</i>-extendable bipartite graphs.
Discret. Math., 2003

To Determine 1-Extendable Graphs and its Algorithm.
Ars Comb., 2003

2001
A polynomial algorithm for cyclic edge connectivity of cubic graphs.
Australas. J Comb., 2001

Vertex-disjoint cycles containing specified edges in a bipartite graph.
Australas. J Comb., 2001

A Highly Efficient Algorithm to Determine Bicritical Graphs.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000
On matchability of graphs.
Australas. J Comb., 2000

1999
A local independence number condition for n-extendable graphs.
Discret. Math., 1999

On the structure of minimally n-extendable bipartite graphs.
Discret. Math., 1999

1997
A Local Neighbourhood Condition for Cycles.
Ars Comb., 1997

1996
The 2-extendability of strongly regular graphs.
Discret. Math., 1996

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

A local neighbourhood condition for n-extendable graphs.
Australas. J Comb., 1996

1995
A neighbourhood union condition for pancyclicity.
Australas. J Comb., 1995

n-extendability of line graphs, power graphs, and total graphs.
Australas. J Comb., 1995

1994
Some conditions for n-extendable graphs.
Australas. J Comb., 1994

1993
N-extendability of symmetric graphs.
J. Graph Theory, 1993

Lower bound of cyclic edge connectivity for n-extendability of regular graphs.
Discret. Math., 1993

1992
Matching extensions of strongly regular graphs.
Australas. J Comb., 1992

1991
On the 2-extendability of planar graphs.
Discret. Math., 1991

Partitioning regular graphs into equicardinal linear forests.
Discret. Math., 1991


  Loading...