default search action
Discrete Applied Mathematics, Volume 287
Volume 287, December 2020
- Alan M. Frieze, Wesley Pegden
, Tomasz Tkocz:
On random multi-dimensional assignment problems. 1-9 - Shu-Li Zhao, Jou-Ming Chang
Reliability assessment of the Cayley graph generated by trees. 10-14
- Chuandong Xu
On characterizing the critical graphs for matching Ramsey numbers. 15-20 - Yuping Gao, Songling Shan
Antimagic orientation of lobsters. 21-26
- R. Khoeilar
A proof of a conjecture on the differential of a subcubic graph. 27-39 - Kazuya Haraguchi
Maximum weighted matching with few edge crossings for 2-layered bipartite graph. 40-52 - Pingshan Li
Fault-tolerant strong Menger (edge) connectivity of arrangement graph. 53-61
- Raphael Steiner
A note on coloring digraphs of large girth. 62-64
- Xiaopeng Yao, Hejiao Huang
Connected positive influence dominating set in k-regular graph. 65-76 - Pengcheng Liu, Zhao Zhang, Xianyue Li
Approximation algorithm for minimum connected 3-path vertex cover. 77-84 - Ovidiu Daescu, Ka Yaw Teo:
Two-dimensional closest pair problem: A closer look. 85-96 - Shuchao Li
Some spectral inequalities for connected bipartite graphs with maximum Aα-index. 97-109 - Xiuzhuan Duan, Bo Ning, Xing Peng, Jian Wang
Maximizing the number of cliques in graphs with given matching number. 110-117 - Lucas Mol
The threshold dimension of a graph. 118-133 - Dion Gijswijt
Computing graph gonality is hard. 134-149
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-12-23 19:20 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: