default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 382
Volume 382, 2026
- Shanshan Yu, Yuefang Sun
:
The directed pendant-tree 3-connectivity of symmetric compositions. 1-9 - Ruy Fabila-Monroy, Sergio Gerardo Gómez-Galicia, César Hernández-Cruz, Ana Laura Trujillo-Negrete:
On the treewidth of token and Johnson graphs. 10-27 - Haiyan Chen, Wei Qiu:
Note on two Kirchhoff index Turán problems. 28-32 - Xiaohui Zhang, Jing Su, Bing Yao:
Graph lattices constructed by super total graceful-type labelings and colorings of topological coding. 33-47 - Sarah E. Anderson, Tanja Dravec, Daniel Johnston, Kirsti Kuenzel:
Orientable total domination in graphs. 48-59 - Károly Bezdek, Zsolt Lángi, Márton Naszódi:
Selected topics from the theory of intersections of balls. 60-82 - Ararat Harutyunyan, Hovhannes A. Harutyunyan, Aram Khanlari:
Bounds on broadcast time in well-connected graphs. 83-90 - Jean-Claude Bermond, Michel Cosnard:
Maximizing the number of requests in oriented trees with a grooming factor. 91-107 - Chaoyu He, Zhiyi Tan:
Random coordination mechanism for scheduling games with machine modification. 108-123 - Darko Dimitrov, Zana Kovijanic Vukicevic, Goran Popivoda, Jelena Sedlar, Riste Skrekovski, Sasa Vujosevic:
The σ -irregularity of trees with maximum degree 5. 124-136 - Christian Komusiewicz, Jannik Schestag:
A multivariate complexity analysis of the Generalized Noah's Ark Problem. 137-154 - Lin Li, Rong-Xia Hao, Yan-Quan Feng, Jaeun Lee, Eddie Cheng:
The lower bounds of 4-tree connectivity of Cartesian product graphs. 155-165 - Zemin Jin, Huifang Liu, Qing Jie:
Two extremal problems for 4-cycles in 4-partite graphs. 166-175 - Yulin Chang, Jichang Wu, Zhiwei Zhang:
Cycles and trees in randomly perturbed sparse digraphs. 176-182 - Amir Keramatian, Vincenzo Gulisano, Marina Papatriantafilou, Philippas Tsigas:
I P . L S H . D B S C A N : Integrated parallel density-based clustering by locality-sensitive hashing. 183-196 - Roger Kameugne, Pierre Wambo, Yves Pascal Ndjopnang Wantiep:
ILP and CP models for normalized integer weighted voting game design problem. 197-209 - David Avis:
H V -symmetric polyhedra and bipolarity. 210-213 - Stefan Dobrev, Rastislav Královic, Dana Pardubská:
Busy agents on a line. 214-233 - Yanhong Zhang, Lei Zhang, Haizhen Ren:
The path-factors and generalized distance spectral radius of graphs. 234-240 - Aofei Hu, Yan Li, Yusheng Li, Ye Wang:
Star-critical Ramsey numbers of trees versus wheels. 241-244 - Patricia Zu'rob, Abdelrahim S. Mousa:
Optimal welfare strategies vs Nash Equilibrium strategies in a game with homogeneous players. 245-258 - Yanhong Chen, Anshui Li, Biao Wu, Huajun Zhang:
On cross-2-intersecting families. 259-271 - Ioan Tomescu:
Maximum bond incident degree indices for trees and unicyclic graphs with given maximum degree. 272-276 - Xiaoyu Chen, Marc Goerigk, Michael Poss:
The robust selection problem with information discovery. 277-292 - Gabriela Araujo-Pardo, Martín Matamala, Juan Pablo Peña, José Zamora:
Lines on digraphs of low diameter. 293-300 - Sourav Chakraborty, Arijit Ghosh, Soumi Nandi:
Colorful two-piercing theorem for boxes. 301-309 - Tingyan Ma, Edwin R. van Dam, Ligong Wang:
Spectral condition for k -factor-criticality in t -connected graphs. 310-316 - Chunli Deng, Junchen Dong, Haifeng Li:
Several bounds on the spectral radius of uniform hypergraphs. 317-326 - Ayun Zhang, Baoleer, Shinya Fujita, Yaping Mao, Gang Yang:
Bip-ordered bipartite Ramsey number. 327-336 - Olivier Baudon, Julien Bensmail, Morgan Boivin, Igor Grzelec, Clara Marcille:
The strong ( 2 , 2 ) -Conjecture for more classes of graphs. 337-354 - Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
( t , r ) -Broadcast Domination in graphs. 355-367
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 2026-07-20 23:18 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
