default search action
Discrete Applied Mathematics, Volume 314
Volume 314, June 2022
- Frédéric Havet
, Allen Ibiapina, Leonardo S. Rocha
On the Nash number and the diminishing Grundy number of a graph. 1-16 - Guoyan Ao, Ruifang Liu, Jinjiang Yuan, Rao Li:
Improved sufficient conditions for k-leaf-connected graphs. 17-30 - Byung-Cheon Choi, Kyung Min Kim, Yunhong Min
A single machine scheduling with generalized and periodic due dates to minimize total deviation. 31-52 - Flavia Bonomo-Braberman
A new approach on locally checkable problems. 53-80 - Jelena Sedlar
Vertex and edge metric dimensions of unicyclic graphs. 81-92 - Vladimir Gurvich:
Metric and ultrametric inequalities for directed graphs. 93-104 - Nathan Fox
On the computational complexities of various Geography variants. 105-128 - Grega Cigler, Marjan Jerman, Piotr Wojciechowski
Transitive systems and conclusive partial orders. 129-141 - Stéphane Bessy
Algorithmic aspects of broadcast independence. 142-149 - Barnaby Martin, Daniël Paulusma
Colouring graphs of bounded diameter in the absence of small cycles. 150-161
- Emmanuel Briand
On partitions with k corners not containing the staircase with one more corner. 162-168
- Wei Li, Shenggui Zhang, Ruonan Li:
Rainbow triangles in arc-colored digraphs. 169-180 - Linya Zhu, Sihong Su
A systematic method of constructing weightwise almost perfectly balanced Boolean functions on an arbitrary number of variables. 181-190
- Marina Moscarini:
A necessary condition for the equality of the clique number and the convexity number of a graph. 191-196
- Amar Bapic
Constructions of (vectorial) bent functions outside the completed Maiorana-McFarland class. 197-212 - Tao Wang, Baoyindureng Wu
The size of graphs with given feedback vertex number. 213-222
- Yury A. Malyshkin
γ-variable first-order logic of preferential attachment random graphs. 223-227
- Fatemeh Nahani Pour, Hossein Abdollahzadeh Ahangar, Mustapha Chellali, Seyed Mahmoud Sheikholeslami:
Global triple Roman dominating function. 228-237 - Grahame Erskine
Clique-partitioned graphs. 238-248
- Junying Lu
A short note on the sum of k largest distance eigenvalues of bipartite graphs. 249-251
- Bin Chen
Turán number of 3-free strong digraphs with out-degree restriction. 252-264 - Marc Hellmuth
Compatibility of partitions with trees, hierarchies, and split systems. 265-283 - Kittitat Iamthong
Word-representability of split graphs generated by morphisms. 284-303 - Jiafei Liu
Vulnerability analysis of multiprocessor system based on burnt pancake networks. 304-320 - Dmitrii S. Taletskii
The number of maximal independent sets in trees with a given number of leaves. 321-330
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-02-15 00:20 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: