Digital Library
Close Browse articles from a journal
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             26 results found
no title author magazine year volume issue page(s) type
1 Algorithmic aspects of broadcast independence Bessy, S.

314 C p. 142-149
article
2 A necessary condition for the equality of the clique number and the convexity number of a graph Moscarini, Marina

314 C p. 191-196
article
3 A new approach on locally checkable problems Bonomo-Braberman, Flavia

314 C p. 53-80
article
4 A short note on the sum of k largest distance eigenvalues of bipartite graphs Lu, Junying

314 C p. 249-251
article
5 A single machine scheduling with generalized and periodic due dates to minimize total deviation Choi, Byung-Cheon

314 C p. 31-52
article
6 A systematic method of constructing weightwise almost perfectly balanced Boolean functions on an arbitrary number of variables Zhu, Linya

314 C p. 181-190
article
7 Clique-partitioned graphs Erskine, Grahame

314 C p. 238-248
article
8 Colouring graphs of bounded diameter in the absence of small cycles Martin, Barnaby

314 C p. 150-161
article
9 Compatibility of partitions with trees, hierarchies, and split systems Hellmuth, Marc

314 C p. 265-283
article
10 Constructions of (vectorial) bent functions outside the completed Maiorana–McFarland class Bapić, A.

314 C p. 197-212
article
11 Editorial Board
314 C p. ii
article
12 Global triple Roman dominating function Nahani Pour, F.

314 C p. 228-237
article
13 Improved sufficient conditions for k -leaf-connected graphs Ao, Guoyan

314 C p. 17-30
article
14 Metric and ultrametric inequalities for directed graphs Gurvich, Vladimir

314 C p. 93-104
article
15 On partitions with k corners not containing the staircase with one more corner Briand, Emmanuel

314 C p. 162-168
article
16 On the computational complexities of various Geography variants Fox, Nathan

314 C p. 105-128
article
17 On the Nash number and the diminishing Grundy number of a graph Havet, Frédéric

314 C p. 1-16
article
18 Rainbow triangles in arc-colored digraphs Li, Wei

314 C p. 169-180
article
19 The number of maximal independent sets in trees with a given number of leaves Taletskii, D.S.

314 C p. 321-330
article
20 The size of graphs with given feedback vertex number Wang, Tao

314 C p. 213-222
article
21 Transitive systems and conclusive partial orders Cigler, Grega

314 C p. 129-141
article
22 Turán number of 3-free strong digraphs with out-degree restriction Chen, Bin

314 C p. 252-264
article
23 γ -variable first-order logic of preferential attachment random graphs Malyshkin, Y.A.

314 C p. 223-227
article
24 Vertex and edge metric dimensions of unicyclic graphs Sedlar, Jelena

314 C p. 81-92
article
25 Vulnerability analysis of multiprocessor system based on burnt pancake networks Liu, Jiafei

314 C p. 304-320
article
26 Word-representability of split graphs generated by morphisms Iamthong, Kittitat

314 C p. 284-303
article
                             26 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands