


default search action
Discrete Applied Mathematics, Volume 363
Volume 363, 2025
- Irene Heinrich, Simon Raßmann

:
Twin-width of graphs with tree-structured decompositions. 1-15 - Fan Wang:

Small matchings extend to Hamiltonian cycles in hypercubes with disjoint faulty edges. 16-26 - Petra Wiederhold

:
Computing the minimal perimeter polygon for digital objects in the triangular tiling. 27-44 - Andrés Jiménez-Losada, Manuel Ordóñez Sánchez

, J. C. Rodríguez-Gómez
:
Games restricted by simplicial complexes and an application to vertiport cooperation. 45-54 - Aida Abiad, Afrouz Jabal Ameli

, Luuk Reijnders
:
The clique number of the exact distance t-power graph: Complexity and eigenvalue bounds. 55-70 - L. Sunil Chandran, Uttam K. Gupta, Dinabandhu Pradhan

:
List recoloring of planar graphs. 71-87 - Michaela Hiller, Arie M. C. A. Koster, Philipp Pabst

:
Upper bounds and approximation results for the k-slow burning problem. 88-104 - Xinyu Huang, Zheng Yan

:
Spanning trees of bipartite graphs with a bounded number of leaves and branch vertices. 105-109 - Lu Huang, Aimei Yu, Rong-Xia Hao:

The ɛ-spectral radius of trees with perfect matchings. 110-130 - Junpeng Zhou, Xiying Yuan, Fan Chen:

A note on stability results for Berge-Ks,t hypergraphs. 131-138 - Hanlin Chen

, Qiuzhi Guo, Yihong Tan:
Computing the matching and independence polynomials of double hexagonal chains. 139-157 - Lu Yu

:
The degree sequence of the preferential attachment model. 158-167 - Foivos Fioravantes

, Nikolaos Melissinos, Theofilos Triommatis:
Maximum locally irregular induced subgraphs via minimum irregulators. 168-189 - Yair Caro, Zsolt Tuza

:
Monochromatic graph decompositions inspired by anti-Ramsey colorings. 190-200 - Lan Lin

, Yixun Lin:
Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes. 201-214 - Wei-Tian Li

:
Antimagic labeling for subdivisions of graphs. 215-223

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














