default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 370
Volume 370, 2025
- Weifan Wang, Lina Zheng, Jing Gu, Yiqiao Wang, Jingjing Huo:
Strict neighbor-distinguishing index of outerplanar graphs. 1-10 - Yipei Zhang, Xiumei Wang
, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng:
Claw-free minimal matching covered graphs. 11-21 - Hossein Dehghani, Thierry Lecroq, Neerja Mhaskar, W. F. Smyth:
Practical KMP/BM style pattern-matching on indeterminate strings. 22-33 - Yongjiang Wu, Lihua Feng, Weijun Liu:
Alternating L-functions of finite digraphs. 34-49 - Xiaolan Hu, Guixian Zhang:
Injective edge chromatic index of sparse graphs. 50-56 - Alexander Karpov, Klas Markström, Søren Riis, Bei Zhou:
Coherent domains and improved lower bounds for the maximum size of Condorcet domains. 57-70 - Ran Lin, Huiyan Feng, Wenhua Li:
Optimal algorithms for online batch scheduling with all possible equal-processing times under periodic pulse interruptions. 71-83 - Rong Chen, Kaiyang Lan, Xinheng Lin, Yidong Zhou:
The chromatic number of odd-hole-free graphs. 84-87 - Seunghun Lee:
The interval coloring impropriety of planar graphs. 88-91 - Jinqiu Zhou, Xing Feng, Weigen Yan:
K4-free planar minimal bricks with the maximum number of edges. 92-102 - Marcel Jackiewicz, Adam Kasperski, Pawel Zielinski:
Computational complexity of the recoverable robust shortest path problem with discrete recourse. 103-110 - Bo Zhu, Shumin Zhang, Jou-Ming Chang, Jinyu Zou:
Fault-tolerability analysis of hypercubes based on 3-component path-structure connectivity. 111-123 - Mir Riyaz Ul Rashid, Shariefuddin Pirzada, Zoran Stanic:
Spectra of the Mycielskian of a signed graph and related products. 124-144 - Kedson Alves Silva, Tanilson Dias dos Santos, Uéverton dos Santos Souza:
Clique Cover on L-EPG representations of graphs. 145-156 - Anand Brahmbhatt, Kartikeya Rai, Amitabha Tripathi:
Measures of closeness to cordiality for graphs. 157-166 - Mingzu Zhang, Hongxi Liu, Chia-Wei Lee, Weihua Yang:
Edge isoperimetric method: At least 2/3 of h-extra edge-connectivity of a kind of cube-based graphs concentrates on 2n-1. 167-174 - Mengyu Duan, Zhiwei Guo, Binlong Li, Shenggui Zhang:
Rainbow transitive triangles in arc-colored digraphs. 175-184
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.
last updated on 2025-09-20 00:38 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:
