Dingjun Lou

From MaRDI portal
Person:534042

Available identifiers

zbMath Open lou.dingjunMaRDI QIDQ534042

List of research outcomes





PublicationDate of PublicationType
Cyclic edge and cyclic vertex connectivity of \((4, 5, 6)\)-fullerene graphs2024-04-30Paper
Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments2023-09-29Paper
The \(k\)-subconnectedness of planar graphs2022-04-29Paper
https://portal.mardi4nfdi.de/entity/Q50715662022-04-22Paper
The cubic graphs with finite cyclic vertex connectivity larger than girth2020-12-04Paper
Hamiltonian cycle properties in \(k\)-extendable non-bipartite graphs with high connectivity2020-06-24Paper
A highly efficient algorithm for maximum cut on Halin graphs2020-01-22Paper
Characterization of \(k\)-subconnected graphs2020-01-14Paper
https://portal.mardi4nfdi.de/entity/Q52063612019-12-18Paper
A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs2019-06-25Paper
A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\)2019-06-25Paper
https://portal.mardi4nfdi.de/entity/Q46833102018-09-20Paper
https://portal.mardi4nfdi.de/entity/Q31343752018-02-09Paper
Extremal and Degree Conditions for Path Extendability in Digraphs2017-09-18Paper
https://portal.mardi4nfdi.de/entity/Q53550442017-09-06Paper
A polynomial time algorithm for cyclic vertex connectivity of cubic graphs2017-07-28Paper
https://portal.mardi4nfdi.de/entity/Q29480622015-09-29Paper
Bipartite double cover and perfect 2-matching covered graph with its algorithm2015-07-24Paper
Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs2012-12-27Paper
M-alternating paths and the construction of defect \(n\)-extendable bipartite graphs with different connectivities2011-05-10Paper
Notes on factor-criticality, extendibility and independence number2011-02-02Paper
https://portal.mardi4nfdi.de/entity/Q30702892011-02-02Paper
Equivalence between Extendibility and Factor-Criticality2011-02-02Paper
Graphs with no \(M\)-alternating paths between two vertices: an update2010-10-28Paper
Algorithms for (0, 1,d)-graphs withdconstrains2010-09-14Paper
Bipartite graphs with a perfect matching and digraphs2009-08-17Paper
M-alternating Hamilton paths and \(M\)-alternating Hamilton cycles2009-06-23Paper
https://portal.mardi4nfdi.de/entity/Q36158202009-03-24Paper
Characterizing defect \(n\)-extendable graphs and \((2n+1)\)-critical graphs2009-01-27Paper
Characterization of graphs with infinite cyclic edge connectivity2008-04-28Paper
Characterizing minimally \(n\)-extendable bipartite graphs2008-04-28Paper
https://portal.mardi4nfdi.de/entity/Q54425352008-02-22Paper
Characterizing defect \(n\)-extendable bipartite graphs with different connectivities2007-05-23Paper
https://portal.mardi4nfdi.de/entity/Q34088562006-11-15Paper
https://portal.mardi4nfdi.de/entity/Q54660352005-08-23Paper
A note on internally disjoint alternating paths in bipartite graphs2005-02-22Paper
Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs2004-11-18Paper
https://portal.mardi4nfdi.de/entity/Q48205272004-10-15Paper
https://portal.mardi4nfdi.de/entity/Q48187922004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q48187882004-10-01Paper
Graphs with no \(M\)-alternating path between two vertices2004-08-06Paper
Vertex-disjoint cycles containing specified vertices in a bipartite graph2004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44551692004-03-16Paper
Connectivity of \(k\)-extendable graphs with large \(k\).2004-01-26Paper
\(M\)-alternating paths in \(n\)-extendable bipartite graphs2003-08-19Paper
https://portal.mardi4nfdi.de/entity/Q45513742002-09-05Paper
A polynomial algorithm for cyclic edge connectivity of cubic graphs2002-02-12Paper
Vertex-disjoint cycles containing specified edges in a bipartite graph2002-01-21Paper
A polynomial algorithm for cyclic edge connectivity of cubic graphs2002-01-02Paper
https://portal.mardi4nfdi.de/entity/Q45167812000-11-20Paper
https://portal.mardi4nfdi.de/entity/Q44885712000-11-05Paper
https://portal.mardi4nfdi.de/entity/Q49400272000-03-01Paper
On the structure of minimally \(n\)-extendable bipartite graphs2000-02-23Paper
A local independence number condition for \(n\)-extendable graphs2000-01-09Paper
https://portal.mardi4nfdi.de/entity/Q43886171998-05-07Paper
https://portal.mardi4nfdi.de/entity/Q43591131998-01-28Paper
https://portal.mardi4nfdi.de/entity/Q52846581997-04-07Paper
https://portal.mardi4nfdi.de/entity/Q48819231996-09-23Paper
https://portal.mardi4nfdi.de/entity/Q48923251996-09-15Paper
The Chvátal-Erdös condition for cycles in triangle-free graphs1996-09-04Paper
The 2-extendability of strongly regular graphs1996-03-24Paper
https://portal.mardi4nfdi.de/entity/Q48581471995-12-12Paper
https://portal.mardi4nfdi.de/entity/Q48427881995-11-29Paper
https://portal.mardi4nfdi.de/entity/Q48427271995-09-07Paper
https://portal.mardi4nfdi.de/entity/Q43043231995-01-26Paper
N‐extendability of symmetric graphs1994-02-01Paper
Corrigendum to: ``On the 2-extendability of planar graphs, Discrete Mathematics 96 (1991) 81-991993-12-15Paper
https://portal.mardi4nfdi.de/entity/Q31345871993-09-16Paper
https://portal.mardi4nfdi.de/entity/Q46936411993-08-31Paper
Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs1993-08-30Paper
https://portal.mardi4nfdi.de/entity/Q40337011993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40305401993-04-01Paper
On the 2-extendability of planar graphs1992-06-28Paper
Partitioning regular graphs into equicardinal linear forests1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q33602011990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37490971987-01-01Paper

Research outcomes over time

This page was built for person: Dingjun Lou