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
 
                             30 results found
no title author magazine year volume issue page(s) type
1 Assistance and interdiction problems on interval graphs Hoang, Hung P.

340 C p. 153-170
article
2 Bounding the sum of the largest signless Laplacian eigenvalues of a graph Abiad, Aida

340 C p. 315-326
article
3 (1,1)-Cluster Editing is polynomial-time solvable Gutin, Gregory

340 C p. 259-271
article
4 Complete bipartite graphs without small rainbow stars Chen, Weizhen

340 C p. 14-20
article
5 Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles Gurvich, Vladimir

340 C p. 53-68
article
6 Editorial Board
340 C p. ii
article
7 Embedding finite involution semigroups in matrices with transposition Lee, Edmond W.H.

340 C p. 327-330
article
8 Estimating distance between an eigenvalue of a signed graph and the spectrum of an induced subgraph Stanić, Zoran

340 C p. 32-40
article
9 Existence of EFX for two additive valuations Mahara, Ryoga

340 C p. 115-122
article
10 Extension of some edge graph problems: Standard, parameterized and approximation complexity Casel, Katrin

340 C p. 183-201
article
11 Extremal problems for connected set enumeration Luo, Zuwen

340 C p. 41-52
article
12 Maxima of the Q -index of non-bipartite graphs: Forbidden short odd cycles Miao, Lu

340 C p. 104-114
article
13 Memory optimal dispersion by anonymous mobile robots Das, Archak

340 C p. 171-182
article
14 Monitoring edge-geodetic sets: Hardness and graph products Haslegrave, John

340 C p. 79-84
article
15 New transmission irregular chemical graphs Xu, Kexiang

340 C p. 286-295
article
16 Nordhaus–Gaddum type inequality for the integer k-matching number of a graph Chen, Qian-Qian

340 C p. 21-31
article
17 On gap-labellings of some families of graphs Weffort-Santos, C.A.

340 C p. 296-314
article
18 On the A α -spectral radius of graphs with given size Chen, Hongzhang

340 C p. 350-362
article
19 On the complexity of the Cable-Trench Problem Benedito, Marcelo P.L.

340 C p. 272-285
article
20 On the generating functions and special functions associated with superoscillations Colombo, F.

340 C p. 215-227
article
21 On the limit of the sequence { C m ( D ) } m = 1 ∞  for a multipartite tournament D Jung, Ji-Hwan

340 C p. 1-13
article
22 On weakly and strongly popular rankings Kraiczy, Sonja

340 C p. 134-152
article
23 P 5 -isolation in graphs Chen, Jie

340 C p. 331-349
article
24 Results about the total chromatic number and the conformability of some families of circulant graphs Faria, Luerbio

340 C p. 123-133
article
25 The minimum Kirchhoff index of phenylene chains Zhang, Leilei

340 C p. 69-75
article
26 The number of ribbon tilings for strips Chen, Yinsong

340 C p. 85-103
article
27 The Overfull Conjecture on split-comparability and split-interval graphs da Soledade Gonzaga, Luis Gustavo

340 C p. 228-238
article
28 The palindromization map Perrin, Dominique

340 C p. 202-214
article
29 The power of small coalitions under two-tier majority on regular graphs Chebotarev, Pavel

340 C p. 239-258
article
30 Two completely independent spanning trees of split graphs Chen, Xiaodong

340 C p. 76-78
article
                             30 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands