Dingjun Lou

From MaRDI portal
(Redirected from Person:534042)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Cyclic edge and cyclic vertex connectivity of \((4, 5, 6)\)-fullerene graphs
Discrete Applied Mathematics
2024-04-30Paper
Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments
Journal of Graph Theory
2023-09-29Paper
The \(k\)-subconnectedness of planar graphs
AIMS Mathematics
2022-04-29Paper
Hamilton paths in \(n\)-extendable bipartite graphs.2022-04-22Paper
The cubic graphs with finite cyclic vertex connectivity larger than girth
Discrete Mathematics
2020-12-04Paper
Hamiltonian cycle properties in k-extendable non-bipartite graphs with high connectivity
Graphs and Combinatorics
2020-06-24Paper
A highly efficient algorithm for maximum cut on Halin graphs2020-01-22Paper
Characterization of \(k\)-subconnected graphs
Applied Mathematics and Computation
2020-01-14Paper
Long cycles in \(n\)-extendable bipartite graphs.2019-12-18Paper
A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs
Journal of Combinatorial Optimization
2019-06-25Paper
A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\)
Journal of Combinatorial Optimization
2019-06-25Paper
Hamilton cycles in \(n\)-extendable bipartite graphs.2018-09-20Paper
A square time algorithm for cyclic edge connectivity of planar graphs.2018-02-09Paper
Extremal and degree conditions for path extendability in digraphs
SIAM Journal on Discrete Mathematics
2017-09-18Paper
scientific article; zbMATH DE number 6770102 (Why is no real title available?)2017-09-06Paper
A polynomial time algorithm for cyclic vertex connectivity of cubic graphs
International Journal of Computer Mathematics
2017-07-28Paper
An improved algorithm for cyclic edge connectivity of regular graphs.2015-09-29Paper
Bipartite double cover and perfect 2-matching covered graph with its algorithm
Frontiers of Mathematics in China
2015-07-24Paper
Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs
Graphs and Combinatorics
2012-12-27Paper
M-alternating paths and the construction of defect \(n\)-extendable bipartite graphs with different connectivities
Discrete Mathematics
2011-05-10Paper
Notes on factor-criticality, extendibility and independence number
(available as arXiv preprint)
2011-02-02Paper
Algorithms for the optimal Hamiltonian path in Halin graphs2011-02-02Paper
Equivalence between extendability and factor-criticality
(available as arXiv preprint)
2011-02-02Paper
Graphs with no M-alternating paths between two vertices: an update
Discrete Mathematics
2010-10-28Paper
Algorithms for (0, 1,<i>d</i>)-graphs with<i>d</i>constrains
International Journal of Computer Mathematics
2010-09-14Paper
Bipartite graphs with a perfect matching and digraphs2009-08-17Paper
Bipartite graphs with a perfect matching and digraphs
(available as arXiv preprint)
2009-08-17Paper
M-alternating Hamilton paths and M-alternating Hamilton cycles
Discrete Mathematics
2009-06-23Paper
scientific article; zbMATH DE number 5532004 (Why is no real title available?)2009-03-24Paper
Characterizing defect \(n\)-extendable graphs and \((2n+1)\)-critical graphs
Discrete Mathematics
2009-01-27Paper
Characterization of graphs with infinite cyclic edge connectivity
Discrete Mathematics
2008-04-28Paper
Characterizing minimally \(n\)-extendable bipartite graphs
Discrete Mathematics
2008-04-28Paper
Path decomposition of defect 1-extendable bipartite graphs2008-02-22Paper
Characterizing defect n-extendable bipartite graphs with different connectivities
Discrete Mathematics
2007-05-23Paper
An efficient algorithm for cyclic edge connectivity of regular graphs.2006-11-15Paper
scientific article; zbMATH DE number 2197893 (Why is no real title available?)2005-08-23Paper
A note on internally disjoint alternating paths in bipartite graphs
Discrete Mathematics
2005-02-22Paper
Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs
Discrete Mathematics
2004-11-18Paper
scientific article; zbMATH DE number 2108132 (Why is no real title available?)2004-10-15Paper
scientific article; zbMATH DE number 2104723 (Why is no real title available?)2004-10-01Paper
scientific article; zbMATH DE number 2104719 (Why is no real title available?)2004-10-01Paper
Graphs with no \(M\)-alternating path between two vertices
Discrete Mathematics
2004-08-06Paper
Vertex-disjoint cycles containing specified vertices in a bipartite graph
Journal of Graph Theory
2004-08-04Paper
scientific article; zbMATH DE number 2058561 (Why is no real title available?)2004-03-16Paper
Connectivity of \(k\)-extendable graphs with large \(k\).
Discrete Applied Mathematics
2004-01-26Paper
\(M\)-alternating paths in \(n\)-extendable bipartite graphs
Discrete Mathematics
2003-08-19Paper
scientific article; zbMATH DE number 1796979 (Why is no real title available?)2002-09-05Paper
A polynomial algorithm for cyclic edge connectivity of cubic graphs2002-02-12Paper
Vertex-disjoint cycles containing specified edges in a bipartite graph
The Australasian Journal of Combinatorics
2002-01-21Paper
A polynomial algorithm for cyclic edge connectivity of cubic graphs
The Australasian Journal of Combinatorics
2002-01-02Paper
scientific article; zbMATH DE number 1533247 (Why is no real title available?)2000-11-20Paper
scientific article; zbMATH DE number 1471076 (Why is no real title available?)2000-11-05Paper
scientific article; zbMATH DE number 1409190 (Why is no real title available?)2000-03-01Paper
On the structure of minimally \(n\)-extendable bipartite graphs
Discrete Mathematics
2000-02-23Paper
A local independence number condition for n-extendable graphs
Discrete Mathematics
2000-01-09Paper
scientific article; zbMATH DE number 1150387 (Why is no real title available?)1998-05-07Paper
scientific article; zbMATH DE number 1071797 (Why is no real title available?)1998-01-28Paper
scientific article; zbMATH DE number 969186 (Why is no real title available?)1997-04-07Paper
scientific article; zbMATH DE number 888846 (Why is no real title available?)1996-09-23Paper
scientific article; zbMATH DE number 927052 (Why is no real title available?)1996-09-15Paper
The Chvátal-Erdös condition for cycles in triangle-free graphs
Discrete Mathematics
1996-09-04Paper
The 2-extendability of strongly regular graphs
Discrete Mathematics
1996-03-24Paper
scientific article; zbMATH DE number 825132 (Why is no real title available?)1995-12-12Paper
scientific article; zbMATH DE number 786226 (Why is no real title available?)1995-11-29Paper
scientific article; zbMATH DE number 786151 (Why is no real title available?)1995-09-07Paper
scientific article; zbMATH DE number 637272 (Why is no real title available?)1995-01-26Paper
N‐extendability of symmetric graphs
Journal of Graph Theory
1994-02-01Paper
Corrigendum to: ``On the 2-extendability of planar graphs'', Discrete Mathematics 96 (1991) 81-99
Discrete Mathematics
1993-12-15Paper
scientific article; zbMATH DE number 411176 (Why is no real title available?)1993-09-16Paper
scientific article; zbMATH DE number 205826 (Why is no real title available?)1993-08-31Paper
Lower bound of cyclic edge connectivity for n-extendability of regular graphs
Discrete Mathematics
1993-08-30Paper
scientific article; zbMATH DE number 166088 (Why is no real title available?)1993-05-16Paper
scientific article; zbMATH DE number 147635 (Why is no real title available?)1993-04-01Paper
On the 2-extendability of planar graphs
Discrete Mathematics
1992-06-28Paper
Partitioning regular graphs into equicardinal linear forests
Discrete Mathematics
1992-06-25Paper
scientific article; zbMATH DE number 4212076 (Why is no real title available?)1990-01-01Paper
scientific article; zbMATH DE number 3985283 (Why is no real title available?)1987-01-01Paper


Research outcomes over time


This page was built for person: Dingjun Lou