Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 344
Volume 344, February 2024
- Arnfried Kemnitz
, Massimiliano Marangio:
On the vertex stability numbers of graphs. 1-9 - Csilla Bujtás, Pakanun Dokyeesun:
Fast winning strategies for Staller in the Maker-Breaker domination game. 10-22
- Beáta Bényi, Sithembele Nkonkobe:
Combinatorial approach of unified Apostol-type polynomials using α-distanced words. 23-31
- Yujun Yang, Can Xu:
On two conjectures concerning spanning tree edge dependences of graphs. 32-42 - Norito Minamikawa:
Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids. 43-67 - Yaser Rowshan, Ali Taherkhani:
Partitioning of a graph into induced subgraphs not containing prescribed cliques. 68-80 - Luyi Li, Xueliang Li, Yuan Si:
Gallai-Ramsey numbers for 3-uniform rainbow Berge triangles and monochromatic linear paths or cycles. 81-87 - Jingyuan Zhang, Fuliang Lu, Xian'an Jin:
Counting spanning trees of (1, N)-periodic graphs. 88-101 - Mikhail Fadin:
Bounds on the defect of an octahedron in a rational lattice. 102-105 - Ryul Kim:
Some relations between the irreducible polynomials over a finite field and its quadratic extension. 106-111 - Sergey Kitaev, Philip B. Zhang:
Non-overlapping descents and ascents in stack-sortable permutations. 112-119 - Jian Lu, Huiqing Liu, Xiaolan Hu:
On strong edge-coloring of graphs with maximum degree 5. 120-128 - Shenwei Huang, Yiao Ju, T. Karthick:
Coloring (P5, kite)-free graphs with small cliques. 129-139 - Xiaohui Zhang, Meimei Zhao, Bing Yao:
Various matching keys for asymmetric topology encryption. 140-153 - Andrey A. Dobrynin, Konstantin V. Vorob'ev:
Some results on the Wiener index related to the Šoltés problem of graphs. 154-160
- Ran Gu, Hui Lei, Yongtang Shi, Yiqiao Wang:
A note on rainbow-free colorings of uniform hypergraphs. 161-169 - Huihui Zhang, Yifei Ran, Jing Huang:
On the star of the family of independent sets in a graph. 170-178
- Tala Abuadas, Ben Cameron, Chính T. Hoàng, Joe Sawada:
Vertex-critical (P3+ℓP1)-free and vertex-critical (gem, co-gem)-free graphs. 179-187
- Fengwei Li, Qingfang Ye, Huajing Lu:
The greatest values for atom-bond sum-connectivity index of graphs with given parameters. 188-196
- Marisa Gutierrez, Bernardo Llano, Miguel A. Pizaña, Silvia B. Tondato:
Diclique digraphs. 197-210
a service of 
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-08-25 19:01 CEST 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:
