


default search action
Discrete Applied Mathematics, Volume 371
Volume 371, 2025
- Peng-Li Zhang, Xiao-Dong Zhang

:
Bounds on the Aα-spectral radius of uniform hypergraphs with some vertices deleted. 1-16 - Didem Gözüpek, Iztok Peterin

:
Grundy packing coloring of graphs. 17-30 - Yushan Qu, Jon Lee

:
On disjunction convex hulls by big-M lifting. 31-45 - Manuel Lafond

, Weidong Luo
:
Preprocessing complexity for some graph problems parameterized by structural parameters. 46-59 - Dazhi Lin, Tao Wang

:
A simplified graph parameter and its relationship to the modified Randić index. 60-64 - Myungho Choi

:
Generalized competitively orientable complete multipartite graphs. 65-72 - Jiuying Dong

, Yingying Yao:
Some new bounds for the energy of graphs. 73-79 - Brian Curcio, Isabel Méndez-Díaz, Paula Zabala:

An exact algorithm for the adjacent vertex distinguishing sum edge coloring problem. 80-98 - Vedran Krcadinac, Shenggui Zhang, Liming Xiong, Dragan Stevanovic:

Research problems from the 1st Chinese-Southeasteuropean conference on discrete mathematics and applications. 99-104 - Hongli Liao, Qiang Wang, Liming Xiong

, Zhang Zhang:
Forbidden Pairs of disconnected graphs for traceability and hamiltonicity. 105-114 - Shiying Wang

, Lina Zhao
, Su Wang:
Fault-tolerant strong Menger connectivity with conditional faults on wheel networks. 115-126 - Vahan Mkrtchyan

:
Three results towards approximation of special maximum matchings in graphs. 127-136 - Kristóf Bérczi

, Tamás Király, Yusuke Kobayashi, Yutaro Yamaguchi, Yu Yokoi:
Finding spanning trees with perfect matchings. 137-147

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














