default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 365
Volume 365, 2025
- Athipatana Iamphongsai, Teeradej Kittipassorn
:
An isoperimetric inequality and pursuit-evasion games on triangular grid graphs. 1-12 - Hua Wang, Andrew Zhang:
Extremal problems on Steiner k-distances. 13-26 - Junlin Huang, Guixian Huang, Jianping Li, Weihua He:
On the minimum Kirchhoff index of graphs with a given number of cut vertices. 27-38 - Flavia Bonomo-Braberman, Eric Brandwein, Carolina Lucía Gonzalez, Agustín Sansone:
On the thinness of trees. 39-60 - Xia Li, Weihua Yang, Bo Zhang, Shuang Zhao:
On regular 2-path Hamiltonian graphs. 61-70 - Minh Hieu Nguyen, Mourad Baïou, Viet Hung Nguyen:
Generalized Nash Fairness Solutions for Bi-Objective Discrete Optimization: Theory and Algorithms. 71-90 - Jueru Liu, Lixiang Chen, Changjiang Bu:
The Laplacian spectral moments of uniform hypergraphs. 91-99 - Quanfeng Xin, Gang Wang:
Characterizing upper bounds of Z-spectral radius of uniform hypergraphs. 100-108 - Xianghui Zhong:
Lower bounds on the integrality ratio of the subtour LP for the traveling salesman problem. 109-129 - Vladimir I. Benediktovich:
Spectral conditions of pancyclicity for t-tough graphs. 130-137 - Subhamoy Maitra, Chandra Sekhar Mukherjee, Pantelimon Stanica, Deng Tang:
Interplay between resiliency and polynomial degree - Recursive amplification, higher order sensitivity and beyond. 138-159 - Bo Ning:
An inductive proof of Dirac's theorem on Hamilton cycles. 160-162 - Thomas M. Kratzke, Douglas B. West:
The total interval number of a graph, III: Tree-like graphs. 163-189 - Alexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anaïs Villedieu, Monika Wißmann:
The complexity of cluster vertex splitting and company. 190-207 - Zhaole Li, Deng Tang:
The Gowers U3 norm of one family of cubic power permutations. 208-222 - Xia Hong, Baogang Xu:
Coloring of (P6,dart, K4)-free graphs. 223-230 - Thang Pham, Steven Senger, Michael Tait, Nguyen Thu-Huyen:
VC-dimension and pseudo-random graphs. 231-246 - Sela Fried, Toufik Mansour:
Counting r×s rectangles in (Catalan) words. 247-259 - T. Kavaskar:
Bounds for boxicity of circular clique graphs and zero-divisor graphs. 260-269
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 2025-03-18 20:34 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:
