Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 353
Volume 353, 2024
- Ararat Harutyunyan, Louisa Harutyunyan, Narek A. Hovhannisyan:
Coloring k-partite sparse digraphs. 1-3 - Jiani Zou, Miaomiao Han, Hong-Jian Lai:
Square coloring of planar graphs with maximum degree at most five. 4-11 - Bryan Coulier, Hatice Çalik, Greet Vanden Berghe:
The constrained Bottleneck Spanning Tree Problem with upgrades. 12-28 - Elias John Thomas, S. V. Ullas Chandran, James Tuite, Gabriele Di Stefano:
On the general position number of Mycielskian graphs. 29-43 - Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima:
Polynomial-time equivalences and refined algorithms for longest common subsequence variants. 44-64 - Yasufumi Aita, Toru Araki:
Secure total domination number in maximal outerplanar graphs. 65-70 - Shaowei Sun, Mengsi Chen:
On claw-free graphs with all but four eigenvalues equal to 0 or -1. 71-84 - Sarah Acquaviva, Deepak Bal:
Full degree spanning trees in random regular graphs. 85-93 - Mustapha Aouchiche, Bilal Ahmad Rather:
Proximity and remoteness in graphs: A survey. 94-120 - Yusuf Civan, Zakir Deniz, Mehmet Akif Yetim:
Gated independence in graphs. 121-138 - Bostjan Bresar, Tanja Dravec, Aysel Erey, Jaka Hedzet:
Spreading in graphs. 139-150 - Sergi Elizalde:
On individual leaf depths of trees. 151-180 - Xiaomin Hu, Xiangyu Ren, Weihua Yang:
Conditional k-matching preclusion for n-dimensional torus networks. 181-190 - Anni Hakanen, Ville Junnila, Tero Laihonen, Ismael G. Yero:
On the unicyclic graphs having vertices that belong to all their (strong) metric bases. 191-207 - Zhiguo Ding, Michael E. Zieve:
On a class of m-to-1 functions. 208-210 - Sela Fried, Toufik Mansour:
Further results on random walk labelings. 211-221 - Markus Ausserhofer, Susanna Dann, Zsolt Lángi, Géza Tóth:
Corrigendum to "An algorithm to find maximum area polygons circumscribed about a convex polygon" [Discrete Appl. Math. 255 (2019) 98-108]. 222-226
a service of 
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 2024-08-03 20:17 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:
