default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 366
Volume 366, 2025
- Nader H. Bshouty, Tsun-Ming Cheung, Gergely Harcos
, Hamed Hatami, Anthony Ostuni:
A tight lower bound on non-adaptive group testing estimation. 1-15 - Tatsuya Fujimori, Shun-ichi Maezawa, Yoshio Okamoto:
The Solitaire Clobber game and the correducibility of k-connected graphs. 16-22 - Hui Li, Yunshu Gao:
Packing two copies of a tree into a bipartite graph with restrained maximum degree. 23-34 - Songnian Xu, Dein Wong, Yan Wang, Fenglei Tian:
Automorphism group of a graph related to zero-divisor graphs. 35-43 - Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang:
Critical (P5,dart)-free graphs. 44-52 - Zhipeng Gao, Rongling Lang, Changqing Xi, Jun Yue:
On 3-component domination numbers in graphs. 53-62 - Cai-Xia Wang, Yu Yang, Shou-Jun Xu:
The algorithm and complexity of secure domination in 3-dimensional box graphs. 63-74 - Simon Brezovnik, Zhongyuan Che, Niko Tratnik, Petra Zigert Pletersek:
Resonance graphs of plane bipartite graphs as daisy cubes. 75-85 - Jingchao Lai, Weigen Yan, Xing Feng:
On the number of perfect matchings of middle graphs. 86-91 - Jianxin Wei, Yujun Yang:
On a conjecture of Eǧecioǧlu and Iršič. 92-105 - Florent Foucaud, Clara Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni:
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs. 106-119 - Sarah E. Anderson, Brenda K. Kroschel:
Zero forcing of generalized hierarchical products. 120-126 - Vadim E. Levit, Eugen Mandrescu:
On almost bipartite non-König-Egerváry graphs. 127-134 - Brent Cody, Garrett Moore:
The k-general d-position problem for graphs. 135-151 - Erika R. Bérczi-Kovács, Kata Kosztolányi:
Testing popularity in linear time via maximum matching. 152-160 - Siyue Chen, Qing Cui, Jingshu Zhang:
A characterization of graphs with maximum cycle isolation number. 161-175 - Qing Cui, Xu Zou:
Domination number, independent domination number and k-independence number in trees. 176-184 - Xiangyu Ren, Jianguo Qian:
On group-valued potential differences and flows in a signed graph. 185-192 - Runze Wang:
A biased edge coloring game. 193-200 - Yuefang Sun, Zemin Jin:
Perfect out-forest problem and directed Steiner cycle packing problem. 201-209 - Boris A. Romov:
Positive existential definability in finite structures. 210-215 - Milica Andelic, Tamara Koledin, Zoran Stanic:
Cubic and quartic net-regular strongly regular signed graphs. 216-225 - Nicola Apollonio:
Functions that are uniquely maximized by sparse quasi-star graphs, and uniquely minimized by quasi-complete graphs. 226-237 - Elize Swartz, Tomás Vetrík:
General sum-connectivity index of unicyclic graphs with given maximum degree. 238-249 - Camino Balbuena, Peter Dankelmann:
On the edge-connectivity of the square of a graph. 250-256
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-19 01:31 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.
