


default search action
Discrete Applied Mathematics, Volume 381
Volume 381, 2026
- Ali Ghalavand

, Xueliang Li:
On the local metric dimension of K 5 -free graphs. 1-6 - Shuang Zhao, Xiaomin Hu, Weihua Yang:

Results on the vertex connectivity of hypergraphs. 7-13 - Zhen-Bin Gao

, Feng-Xia Chen:
Strong vertex Euclidean graphs. 14-22 - Huimei Guo

, Rong-Xia Hao
, Jou-Ming Chang:
2-edge-Hamilton-connectedness of complete hypercube-like networks. 23-31 - Chenlin Yang, Tao Tian

, Shuming Zhou:
Resistance distance and spanning trees of generalized multiple complete split-like graph. 32-39 - Hong Yang, Changchang Dong, Juan Liu:

Antidirected Hamilton cycles in k -hypertournaments. 40-56 - Hui Li, Ning Wang, Yunshu Gao:

Packing two trees into a graph with restrained maximum degree. 57-65 - Jiangdong Ai

, Fankang He
, Yihang Liu, Bo Ning:
On the degree power sum in P k -free graphs. 66-70 - Wei Zuo, Huazhong Lü

:
Hamiltonian cycle and path of folded hypercube with faulty matchings. 71-79 - Chunlin You:

A note on degree conditions for Ramsey goodness of paths. 92-97 - Paola T. Pantoja, Simone Dantas, Atílio G. Luiz

:
On graceful colorings in subcubic trees. 98-111 - Fuyuan Yang, Qiang Sun, Chao Zhang

:
Characterizations of graphs with equal vertex and coalition number. 112-119 - Ruixia Wang, Lie Ma, Qiaoping Guo:

Hamiltonicity and bipancyclicity of balanced bipartite digraphs. 120-128 - Arun Kumar Das

:
Charging station placement for limited energy robots. 129-136 - Sangam Balchandar Reddy, Anjeneya Swami Kare

:
Structural parameterization of minus domination. 137-150 - Weimin Li, Jianping Li, Weihua He, Jianbin Zhang:

The ϵ -spectral radii of k -uniform hypertrees. 151-162 - Erfei Yue

:
On Bollobás-type theorems of d -tuples. 163-172 - George Teseleanu

:
Revisiting Takagi-Lim et al. family schemes. 173-195 - Alessandro Aloisio, Alfredo Navarra

:
On budget-constrained coverage in Multi-Interface networks: Branchwidth and treewidth perspectives. 196-213 - C. U. Angeliya

, Arnab Char, T. Karthick
:
On near optimal colorable graphs. 214-231 - Kung-Jui Pai

:
An improved upper bound on the queue number of the folded hypercube. 232-236 - Meng Liu, Yusheng Li:

A note on large cliques in complex networks - A Ramsey theory approach. 237-241 - Chunfang Li, Shangwei Lin

:
A note on the restricted edge connectivity and perfect matchings of regular graphs. 242-245 - Riccardo W. Maffucci:

On self-duality and unigraphicity for 3-polytopes. 246-260 - Saúl A. Blanco

, Charles Buehrle:
Bounds on the genus for 2-cell embeddings of prefix-reversal graphs. 261-275 - Hechao Liu, Lu Li, Lihua You, Hongbo Hua, Liang Chen:

Enumeration of spanning trees and resistance distances of generalized blow-up graphs. 276-291 - Pierre Bergé

, Mari Chaikovskaia, Jean-Philippe Gayon, Alain Quilliot:
Approximation algorithms for demand-based job scheduling with reconfigurable resources. 292-312 - Yanqing Wu:

On injective edge coloring for a class of graphs with maximum degree 5. 313-320

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














