default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 254
Volume 254, February 2019
- Meysam Alishahi
, Ali Taherkhani:
On the random version of the Erdős matching conjecture. 1-9 - Esther M. Arkin, Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell, Michael Segal:
Locating battery charging stations to facilitate almost shortest paths. 10-16 - Ganbileg Bat-Ochir:
On the number of points with pairwise integral distances on a circle. 17-32 - Joshua Carlson, Leslie Hogben, Jürgen Kritschgau, Kate J. Lorenzen, Michael Segal, Seth Selken, Vicente Valle Martinez:
Throttling positive semidefinite zero forcing propagation time on graphs. 33-46 - Jihoon Choi, Soogang Eoh, Suh-Ryung Kim, Jung Yeun Lee, Yoshio Sano:
The partial order competition dimensions of bipartite graphs. 47-55 - Colin Cooper, Martin E. Dyer, Catherine S. Greenhill, Andrew J. Handley:
The flip Markov chain for connected regular graphs. 56-79 - Christophe Crespelle, Anthony Perez, Ioan Todinca:
An O(n2) time algorithm for the minimal permutation completion problem. 80-95 - François Dross, Mickaël Montassier, Alexandre Pinlou:
Large induced forests in planar graphs with girth 4. 96-106 - Andrzej Dudek, Alan M. Frieze, Wesley Pegden:
A note on the localization number of random graphs: Diameter two case. 107-112 - Michitaka Furuya, Takamasa Yashima:
The existence of f-forests and f-trees in graphs. 113-123 - Dániel Gerbner, Máté Vizer:
Majority problems of large query size. 124-134 - Jong Yoon Hyun, Hyun Kwang Kim, Minwon Na:
Optimal non-projective linear codes constructed from down-sets. 135-145 - Daniel Jones:
On two-sided Max-Linear equations. 146-160 - Brian G. Kronenthal, Felix Lazebnik, Jason Williford:
On the uniqueness of some girth eight algebraically defined graphs, Part II. 161-170 - Meng Liu, Yusheng Li:
Bipartite Ramsey numbers of paths for random graphs. 171-174 - Mei Lu, Jiale Xu, Yi Zhang:
Identifying codes in the direct product of a complete graph and some special graphs. 175-182 - Ana Silva:
Graphs with small fall-spectrum. 183-188 - Kun Wang, Xiangfeng Pan, Wenjie Ning:
On the signless Laplacian Estrada index of cacti. 189-195 - Haibo Wu, Colton Magnant, Pouria Salehi Nowbandegani, Suman Xia:
All partitions have small parts - Gallai-Ramsey numbers of bipartite graphs. 196-203 - Huihui Zhang, Shuchao Li, Baogen Xu:
Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index. 204-221 - Xiaoling Zhang:
Inertia and distance energy of line graphs of unicyclic graphs. 222-233 - Xiao-Xin Zhao, Tian Tian, Wen-Feng Qi:
An interleaved method for constructing de Bruijn sequences. 234-245 - Jianming Zhu, Ju Yang:
On the minimal matching energies of unicyclic graphs. 246-255 - Zhongxun Zhu, Jia-Bao Liu:
The normalized Laplacian, degree-Kirchhoff index and the spanning tree numbers of generalized phenylenes. 256-267
- Yin Chen, Baoyindureng Wu:
On the geometric-arithmetic index of a graph. 268-273 - Ashwin Ganesan:
Fault tolerant supergraphs with automorphisms. 274-279 - Majid Hajian, Nader Jafari Rad:
A new lower bound on the double domination number of a graph. 280-282 - Anne-Sophie Himmel, Clemens Hoffmann, Pascal Kunz, Vincent Froese, Manuel Sorge:
Computational complexity aspects of point visibility graphs. 283-290 - Jian Wang, Weihua Yang:
The Turán number for spanning linear forests. 291-294 - Enqiang Zhu, Chanjuan Liu:
On the semitotal domination number of line graphs. 295-298
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-03-01 15:12 CET 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:
