default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDingjun Lou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j56]Jun Liang
, Xinyao Liu, Dingjun Lou, Zan-Bo Zhang, Zixin Qin:
Cyclic edge and cyclic vertex connectivity of (4,5,6)-fullerene graphs. Discret. Appl. Math. 351: 94-104 (2024)- 2022
- [j55]Tianhong Xiong, Maolin Pan, Yang Yu, Dingjun Lou:
Conformance Between Choreography and Collaboration in BPMN Involving Multi-Instance Participants. Int. J. Pattern Recognit. Artif. Intell. 36(7): 2259013:1-2259013:21 (2022) - 2021
- [j54]Jun Liang, Dingjun Lou, Zan-Bo Zhang:
The cubic graphs with finite cyclic vertex connectivity larger than girth. Discret. Math. 344(2): 112197 (2021) - [j53]Zan-Bo Zhang, Xiaoyan Zhang, Gregory Z. Gutin, Dingjun Lou:
Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments. J. Graph Theory 96(2): 171-191 (2021) - [c7]Tianhong Xiong, Yang Xu, Yang Yu, Dingjun Lou:
Research on Temporal Workflow Task Assignment Strategy. ChineseCSCW (1) 2021: 148-163 - 2020
- [j52]Tianhong Xiong, Maolin Pan, Yang Yu, Dingjun Lou:
Detecting Data Flow Errors Across Processes in Business Process Collaboration. IEEE Access 8: 170862-170871 (2020) - [j51]Zongrong Qin, Dingjun Lou, Huiquan Zhu, Jun Liang:
Characterization of k-subconnected graphs. Appl. Math. Comput. 364 (2020) - [j50]Zhiyong Gan, Dingjun Lou, Yanping Xu:
Hamiltonian Cycle Properties in k-Extendable Non-bipartite Graphs with High Connectivity. Graphs Comb. 36(4): 1043-1058 (2020)
2010 – 2019
- 2019
- [j49]Jun Liang, Dingjun Lou:
A polynomial algorithm determining cyclic vertex connectivity of k-regular graphs with fixed k. J. Comb. Optim. 37(3): 1000-1010 (2019) - [j48]Jun Liang, Dingjun Lou, Zongrong Qin, Qinglin Yu:
A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs. J. Comb. Optim. 38(2): 589-607 (2019) - 2018
- [j47]Yueping Li, Dingjun Lou:
Hamilton Cycles in n-Extendable Bipartite Graphs. Ars Comb. 139: 3-18 (2018) - 2017
- [j46]Dingjun Lou, Rongsheng Zhao:
Panconnectedness of K-trees with Sufficiently Large Toughness. Ars Comb. 130: 181-196 (2017) - [j45]Dingjun Lou:
A Square Time Algorithm for Cyclic Edge Connectivity of Planar Graphs. Ars Comb. 133: 69-92 (2017) - [j44]Jun Liang, Dingjun Lou, Zan-Bo Zhang:
A polynomial time algorithm for cyclic vertex connectivity of cubic graphs. Int. J. Comput. Math. 94(7): 1501-1514 (2017) - [j43]Zan-Bo Zhang, Xiaoyan Zhang, Hajo Broersma, Dingjun Lou:
Extremal and Degree Conditions for Path Extendability in Digraphs. SIAM J. Discret. Math. 31(3): 1990-2014 (2017) - 2014
- [j42]Dingjun Lou, Kangqi Liang:
An Improved Algorithm for Cyclic Edge Connectivity of Regular Graphs. Ars Comb. 115: 315-333 (2014) - 2012
- [j41]Zan-Bo Zhang, Xiaoyan Zhang, Dingjun Lou, Xuelian Wen:
Minimum Size of n-Factor-Critical Graphs and k-Extendable Graphs. Graphs Comb. 28(3): 433-448 (2012) - 2011
- [j40]Xuelian Wen, Zan-Bo Zhang, Dingjun Lou:
M-alternating paths and the construction of defect n-extendable bipartite graphs with different connectivities. Discret. Math. 311(10-11): 817-826 (2011) - 2010
- [j39]Dingjun Lou:
Graphs with no M-alternating paths between two vertices: An update. Discret. Math. 310(23): 3429-3431 (2010) - [j38]Yueping Li, Dingjun Lou, Yunting Lu:
Algorithms for (0, 1, d)-graphs with d constrains. Int. J. Comput. Math. 87(8): 1680-1691 (2010)
2000 – 2009
- 2009
- [j37]Zan-Bo Zhang, Yueping Li, Dingjun Lou:
M-alternating Hamilton paths and M-alternating Hamilton cycles. Discret. Math. 309(10): 3385-3392 (2009) - 2008
- [j36]Yueping Li, Dingjun Lou, Yunting Lu:
Algorithms For The Optimal Hamiltonian Path In Halin Graphs. Ars Comb. 87 (2008) - [j35]Zan-Bo Zhang, Dingjun Lou, Xiaoyan Zhang:
Notes on factor-critically, extendability and independence number. Ars Comb. 87 (2008) - [j34]Dingjun Lou, Wei Wang:
Characterization of graphs with infinite cyclic edge connectivity. Discret. Math. 308(11): 2094-2103 (2008) - [j33]Dingjun Lou:
Characterizing minimally n-extendable bipartite graphs. Discret. Math. 308(11): 2269-2272 (2008) - [j32]Xuelian Wen, Dingjun Lou:
Characterizing defect n-extendable graphs and (2n+1)-critical graphs. Discret. Math. 308(22): 5064-5069 (2008) - 2007
- [j31]Xuelian Wen, Dingjun Lou:
Path decomposition of defect 1-extendable bipartite graphs. Australas. J Comb. 39: 175-182 (2007) - [j30]Zan-Bo Zhang, Tao Wang, Dingjun Lou:
Equivalence between Extendability and Factor-Criticality. Ars Comb. 85 (2007) - [j29]Xuelian Wen, Dingjun Lou:
Characterizing defect n-extendable bipartite graphs with different connectivities. Discret. Math. 307(15): 1898-1908 (2007) - [c6]Yueping Li, Dingjun Lou:
Finding the ( n , k , 0)-Extendability in Bipartite Graphs and Its Application. International Conference on Computational Science (3) 2007: 401-409 - [c5]Yunting Lu, Dingjun Lou:
An Algorithm to Solve the Partition into Perfect Matchings Problem in Halin Graphs. International Conference on Computational Science (3) 2007: 410-418 - [c4]Yunting Lu, Yueping Li, Dingjun Lou:
A Linear Algorithm to Find the Maximum-weighted Matching in Halin Graphs. IMECS 2007: 2274-2278 - [c3]Yueping Li, Dingjun Lou:
Matching Extendability Augmentation in Bipartite Graphs. IMECS 2007: 2291-2296 - [c2]Yueping Li, Dingjun Lou:
A New Algorithm for Determinating 1-extendable Graphs: Design and Implementation. IMECS 2007: 2327-2332 - 2005
- [j28]Dingjun Lou, Wei Wang:
An Efficient Algorithm for Cyclic Edge Connectivity of Regular Graphs. Ars Comb. 77 (2005) - [j27]Dingjun Lou, Akira Saito, Lihua Teng:
A note on internally disjoint alternating paths in bipartite graphs. Discret. Math. 290(1): 105-108 (2005) - 2004
- [j26]Dingjun Lou, Huiquan Zhu:
A note on max-leaves spanning tree problem in Halin graphs. Australas. J Comb. 29: 95-98 (2004) - [j25]Dingjun Lou, Qinglin Yu:
Sufficient conditions for n-matchable graphs. Australas. J Comb. 29: 127-134 (2004) - [j24]Dingjun Lou, Dongning Rao:
Characterizing factor critical graphs and an algorithm. Australas. J Comb. 30: 51-56 (2004) - [j23]Dingjun Lou, Qinglin Yu:
Connectivity of k-extendable graphs with large k. Discret. Appl. Math. 136(1): 55-61 (2004) - [j22]Dingjun Lou, Dongning Rao:
Graphs with no M-alternating path between two vertices. Discret. Math. 280(1-3): 237-240 (2004) - [j21]Robert E. L. Aldred, Derek A. Holton, Dingjun Lou, Ning Zhong:
Characterizing 2k-critical graphs and n-extendable graphs. Discret. Math. 287(1-3): 135-139 (2004) - [j20]Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito:
Vertex-disjoint cycles containing specified vertices in a bipartite graph. J. Graph Theory 46(3): 145-166 (2004) - 2003
- [j19]Dingjun Lou, Akira Saito, Lihua Teng:
To Determine 1-Extendable Graphs and its Algorithm. Ars Comb. 69 (2003) - [j18]Robert E. L. Aldred, Derek A. Holton, Dingjun Lou, Akira Saito:
M-alternating paths in n-extendable bipartite graphs. Discret. Math. 269(1-3): 1-11 (2003) - 2001
- [j17]Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito:
Vertex-disjoint cycles containing specified edges in a bipartite graph. Australas. J Comb. 23: 37-48 (2001) - [j16]Dingjun Lou, Lihua Teng, Xiangjun Wu:
A polynomial algorithm for cyclic edge connectivity of cubic graphs. Australas. J Comb. 24: 247-260 (2001) - [c1]Dingjun Lou, Ning Zhong:
A Highly Efficient Algorithm to Determine Bicritical Graphs. COCOON 2001: 349-356 - 2000
- [j15]Dingjun Lou:
On matchability of graphs. Australas. J Comb. 21: 201-210 (2000)
1990 – 1999
- 1999
- [j14]Dingjun Lou:
A local independence number condition for n-extendable graphs. Discret. Math. 195(1-3): 263-268 (1999) - [j13]Dingjun Lou:
On the structure of minimally n-extendable bipartite graphs. Discret. Math. 202(1-3): 173-181 (1999) - 1997
- [j12]Dingjun Lou:
A Local Neighbourhood Condition for Cycles. Ars Comb. 45 (1997) - 1996
- [j11]Dingjun Lou:
A local neighbourhood condition for n-extendable graphs. Australas. J Comb. 14: 229-234 (1996) - [j10]Dingjun Lou, Qingwei Zhu:
The 2-extendability of strongly regular graphs. Discret. Math. 148(1-3): 133-140 (1996) - [j9]Dingjun Lou:
The Chvátal-Erdös condition for cycles in triangle-free graphs. Discret. Math. 152(1-3): 253-257 (1996) - 1995
- [j8]Derek A. Holton, Dingjun Lou, K. L. McAvaney:
n-extendability of line graphs, power graphs, and total graphs. Australas. J Comb. 11: 215-222 (1995) - [j7]Bolian Liu, Dingjun Lou, Kewen Zhao:
A neighbourhood union condition for pancyclicity. Australas. J Comb. 12: 81-92 (1995) - 1994
- [j6]Dingjun Lou:
Some conditions for n-extendable graphs. Australas. J Comb. 9: 123-136 (1994) - 1993
- [j5]Dingjun Lou, Derek A. Holton:
Lower bound of cyclic edge connectivity for n-extendability of regular graphs. Discret. Math. 112(1-3): 139-150 (1993) - [j4]Robert E. L. Aldred, Derek A. Holton, Dingjun Lou:
N-extendability of symmetric graphs. J. Graph Theory 17(2): 253-261 (1993) - 1992
- [j3]Derek A. Holton, Dingjun Lou:
Matching extensions of strongly regular graphs. Australas. J Comb. 6: 187-208 (1992) - 1991
- [j2]Robert E. L. Aldred, Bill Jackson, Dingjun Lou, Akira Saito:
Partitioning regular graphs into equicardinal linear forests. Discret. Math. 88(1): 1-9 (1991) - [j1]Derek A. Holton, Dingjun Lou, Michael D. Plummer:
On the 2-extendability of planar graphs. Discret. Math. 96(2): 81-99 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
