default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 375
Volume 375, 2025
- Ali Ghalavand
, Xueliang Li:
On maximum induced forests of the balanced bipartite graphs. 1-6 - Bodo Manthey, Jesse van Rhijn:
Performance of efficient variants of the 2-Opt heuristic for the traveling salesperson problem. 7-16 - Jiachang Ye, Jianguo Qian, Zoran Stanic:
Determining some graph joins by the signless Laplacian spectrum. 17-24 - Wangyi Shang, Hajo Broersma, Shenggui Zhang, Binlong Li:
Closures and heavy pairs for hamiltonicity. 25-37 - J. George Barnabas, Venkataraman Yegnanarayanan, Bryan Freyberg:
A note on prime distance graphs with chromatic number 3 or 4. 38-44 - Xiaoxue Hu, Jiangxu Kong, Weifan Wang, Wanshun Yang:
Dynamic coloring of IC-planar graphs. 45-49 - Xia Guo, Jiyong Chen, Xian'an Jin:
Degree sequences for k-regulable ribbon realizations. 50-65 - Qi Wu, Jialei Song, Yong Lu:
The rank of a complex unit gain graph in terms of the rank and the independence number of its underlying graph. 66-78 - Guangfu Wang, Chenyang Li:
l1-embeddability under the edge-gluing operation on some nonbipartite graphs. 79-84 - Rashad Moqa, Jiongzhi Zheng, Kun He:
Online and offline packing cylinders in a cylindrical container. 85-104 - Jessica Singer, Javier Marenco:
A polyhedral study of the maximum-impact coloring problem on hypergraphs. 105-121 - Vladimir P. Korzhik:
The number of nonisomorphic nonorientable 6-gonal embeddings of complete graphs. 122-128 - Mengze Qian, Ryuhei Uehara:
Constant time enumeration of weighted trees. 129-138 - Yu Guan, Sihong Su:
Constructions of 2-rotation symmetric bent functions based on Maiorana-McFarland's bent function. 139-153 - Yu Li, Lizhu Sun, Changjiang Bu:
The resistance distance of a dual number weighted graph. 154-165 - Josep Fàbrega, Xavier Marcote, Xavier Muñoz:
On the size of immune sets in the k-PULL infection model. 166-177 - Christopher Hojny, Frits C. R. Spieksma, Sten Wessel:
Fairness in graph-theoretical optimization problems. 178-192 - Quentin Bramas, Pascal Lafourcade, Stéphane Devismes:
Infinite grid exploration with synchronous myopic robots without chirality. 193-214 - Dipayan Chakraborty, Annegret K. Wagler:
On open-separating dominating codes in graphs. 215-238 - Ming Jiang, Xiaogang Liu, Jing Wang:
Laplacian pair state transfer in Q-graph. 239-258 - Jiangdong Ai, Yiming Hao, Zhaoxiang Li, Qi Shao:
Arc-disjoint in- and out-branchings in semicomplete split digraphs. 259-268 - Yanyan Song, Yaping Mao:
Multicolor induced Ramsey numbers. 269-280 - Qi Yan, Yuancheng Li:
Partial Petrial polynomials for complete graphs and paths. 281-289 - Xing Feng, Zejun Huang:
Extremal numbers of leaves for trees with fixed diameter and maximum degree. 290-293 - Yuan Chen, Shuchao Li, Luying Zhang, Minjie Zhang:
Spectral extrema of F2-free graphs with given size revisited. 294-307 - Li Zhang, Genjiu Xu, Hao Sun, Wenzhong Li:
Sharing the losses of a hierarchical venture. 308-315 - Yu Wang, Dan Li:
Extremal spectral radius of graphs with cyclic edge-connectivity. 316-331 - Qiao Lin, Xiaolin Wang:
Characterize all C5-free diameter-2-critical graphs with at least ⌊(n-1)24⌋+1 edges. 332-337 - Y. S. Kwon, Alexander D. Mednykh, Ilya A. Mednykh:
On the structure of Laplacian characteristic polynomial for circulant foliation. 338-349
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-05-15 23:37 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:
