Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
 
Zoeken naar met titel:
ABCDEFGHIJKLMNOPQRSTUVWXYZ

 
<< vorige   
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             4768 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
4001 Star-critical Ramsey numbers involving large books Li, Yan
31-40 C p. 68-76
 artikel
4002 Star-factors with large components, fractional k -extendability and spectral radius in graphs Zhou, Sizhong
31-40 C p. 402-411
 artikel
4003 Starting time minimization for the maximum job variant Epstein, Leah
31-40 C p. 79-87
 artikel
4004 State transfer and star complements in graphs Zhou, Jiang
31-40 C p. 130-134
 artikel
4005 State transfers in vertex complemented coronas Wang, Jing
31-40 C p. 165-178
 artikel
4006 Statistics on bargraphs viewed as cornerless Motzkin paths Deutsch, Emeric
 2017
 31-40 C p. 54-66
13 p.
 artikel
4007 Statistics on trapezoidal words and k -inversion sequences Liu, Shao-Hua
31-40 C p. 1-8
 artikel
4008 Steady state analysis of timed event graphs with time window constraints Lee, Tae-Eog
 2014
 31-40 C p. 202-216
15 p.
 artikel
4009 Steinberg-like theorems for backbone colouring Araujo, J.
 2018
 31-40 C p. 155-167
 artikel
4010 Steiner diameter of 3, 4 and 5-connected maximal planar graphs Ali, Patrick
 2014
 31-40 C p. 222-228
7 p.
 artikel
4011 Stirling networks: a versatile combinatorial topology for multiprocessor systems Das, Sajal K.
 1992
 31-40 C p. 119-146
28 p.
 artikel
4012 Storing four elements in the two query bitprobe model Baig, Mirza Galib Anwarul Husain
31-40 C p. 121-131
 artikel
4013 Streaming algorithms for multitasking scheduling with shared processing Fu, Bin
31-40 C p. 346-355
 artikel
4014 Streaming algorithms for robust submodular maximization Yang, Ruiqi
31-40 C p. 112-122
 artikel
4015 Strengthened bounds for the probability of k -out-of- n events Qiu, Feng
 2016
 31-40 C p. 232-240
9 p.
 artikel
4016 Strengthened Ore conditions for ( s , t ) -supereulerian graphs Lei, Lan
31-40 C p. 68-80
 artikel
4017 Strengthening Brooks’ chromatic bound on P 6 -free graphs Gupta, Uttam K.
31-40 C p. 334-346
 artikel
4018 Strict chordal digraphs viewed as graphs with distinguished edges McKee, Terry A.
31-40 C p. 122-126
 artikel
4019 Strictly unimodality of the probability that the binomial distribution is more than its expectation Sun, Ping
31-40 C p. 1-5
 artikel
4020 Strict neighbor-distinguishing index of K 4 -minor-free graphs Gu, Jing
31-40 C p. 87-95
 artikel
4021 Strict neighbor-distinguishing index of outerplanar graphs Wang, Weifan
31-40 C p. 1-10
 artikel
4022 Strict optimal rubbling of graphs Murphy, Kyle
31-40 C p. 349-361
 artikel
4023 Strong chromatic index of K 1 , t -free graphs Dębski, Michał
31-40 C p. 53-60
 artikel
4024 Strong cliques and equistability of EPT graphs Alcón, Liliana
 2016
 31-40 C p. 13-25
13 p.
 artikel
4025 Strong cuts from compatibility relations for the Dial-a-Ride Problem Morapitiye, Sunil
31-40 C p. 240-257
 artikel
4026 Strong edge-coloring of cubic bipartite graphs: A counterexample Cranston, Daniel W.
31-40 C p. 258-260
 artikel
4027 Strong edge-coloring of 2-degenerate graphs Yu, Gexin
31-40 C p. 11-14
 artikel
4028 Strong edge-colouring of sparse planar graphs Bensmail, Julien
 2014
 31-40 C p. 229-234
6 p.
 artikel
4029 Strong equality of Roman and weak Roman domination in trees Alvarado, José D.
 2016
 31-40 C p. 19-26
8 p.
 artikel
4030 Strong incidence coloring of outerplanar graphs Mousavi, Fatemeh Sadat
31-40 C p. 293-301
 artikel
4031 Strong intractability results for generalized convex recoloring problems Moura, Phablo F.S.
31-40 C p. 252-260
 artikel
4032 Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems Illés, Tibor
 2016
 31-40 C p. 201-210
10 p.
 artikel
4033 Strongly restricted permutations and tiling with fences Edwards, Kenneth
 2015
 31-40 C p. 82-90
9 p.
 artikel
4034 Strongly self-centered orientation of complete k -partite graphs Miao, Huifang
 2014
 31-40 C p. 119-125
7 p.
 artikel
4035 Strongly separable matrices for nonadaptive combinatorial group testing Fan, Jinping
31-40 C p. 180-187
 artikel
4036 Strong products of hypergraphs: Unique prime factorization theorems and algorithms Hellmuth, Marc
 2014
 31-40 C p. 60-71
12 p.
 artikel
4037 Strong rainbow connection in digraphs Sidorowicz, Elżbieta
 2018
 31-40 C p. 133-143
 artikel
4038 Strong resolving graphs: The realization and the characterization problems Kuziak, Dorota
 2018
 31-40 C p. 270-287
 artikel
4039 Strong resolving partitions for strong product graphs and Cartesian product graphs González Yero, Ismael
 2016
 31-40 C p. 70-78
9 p.
 artikel
4040 Structural and spectral properties of corona graphs Sharma, Rohan
 2017
 31-40 C p. 14-31
18 p.
 artikel
4041 Structural insights about avoiding transfers in the patient-to-room assignment problem Brandt, Tabea
31-40 C p. 231-248
 artikel
4042 Structurally parameterized d -scattered set Katsikarelis, Ioannis
31-40 C p. 168-186
 artikel
4043 Structural parameterization for minimum conflict-free colouring Ashok, Pradeesha
31-40 C p. 239-253
 artikel
4044 Structural parameters, tight bounds, and approximation for ( k , r ) -center Katsikarelis, Ioannis
 2019
 31-40 C p. 90-117
 artikel
4045 Structural properties of resonance graphs of plane elementary bipartite graphs Che, Zhongyuan
31-40 C p. 102-110
 artikel
4046 Structural properties of the minimum cut of partially-supplied graphs Griffing, Alexander R.
 2014
 31-40 C p. 152-157
6 p.
 artikel
4047 Structure and coloring of ( P 7 , C 5 , diamond)-free graphs Chen, Ran
31-40 C p. 298-307
 artikel
4048 Structure and enumeration results of matchable Lucas cubes Wang, Xu
31-40 C p. 263-279
 artikel
4049 Structure connectivity and substructure connectivity of split-star networks Zhao, Lina
31-40 C p. 359-371
 artikel
4050 Structure connectivity and substructure connectivity of star graphs Li, Chunfang
31-40 C p. 472-480
 artikel
4051 Structure of cycles in minimal strong digraphs Arcos-Argudo, Miguel
 2019
 31-40 C p. 35-41
 artikel
4052 Structure of some ( P 7 , C 4 )-free graphs with application to colorings Chen, Ran
31-40 C p. 14-23
 artikel
4053 Student-project allocation with preferences over projects: Algorithmic and experimental results Manlove, David
31-40 C p. 220-234
 artikel
4054 Study on geometric–arithmetic, arithmetic–geometric and Randić indices of graphs Das, Kinkar Chandra
31-40 C p. 229-245
 artikel
4055 Subdivisions of four blocks cycles in digraphs with large chromatic number Al-Mniny, Darine
31-40 C p. 71-75
 artikel
4056 Subgraphs with orthogonal factorizations in graphs Zhou, Sizhong
31-40 C p. 29-34
 artikel
4057 Sublinear approximation algorithms for boxicity and related problems Adiga, Abhijin
 2018
 31-40 C p. 7-22
 artikel
4058 Submodular goal value of Boolean functions Bach, Eric
 2018
 31-40 C p. 1-13
 artikel
4059 Submodular + Supermodular function maximization with knapsack constraint Shi, Majun
31-40 C p. 113-133
 artikel
4060 Subnetwork reliability analysis in k -ary n -cubes Feng, Kai
 2019
 31-40 C p. 85-92
 artikel
4061 Subnetwork reliability analysis of star networks Hu, Xiaomin
31-40 C p. 180-188
 artikel
4062 Subprime and superprime graphs Belkhechine, Houmem
31-40 C p. 133-140
 artikel
4063 Substitutable choice functions and convex geometry Fuji, Jugo
 2015
 31-40 C p. 283-285
3 p.
 artikel
4064 Sub-trees of a random tree Kamiński, Bogumił
 2019
 31-40 C p. 119-129
 artikel
4065 Succinct data structures for bounded clique-width graphs Chakraborty, Sankardeep
31-40 C p. 55-68
 artikel
4066 Sufficient conditions for a balanced bipartite digraph to be even pancyclic Darbinyan, Samvel Kh.
 2018
 31-40 C p. 70-76
 artikel
4067 Sufficient conditions for graphs with girth g to be maximally k -restricted edge connected Zhang, Lei
 2019
 31-40 C p. 320-325
 artikel
4068 Sufficient conditions for Hamiltonian cycles in bipartite digraphs Darbinyan, Samvel Kh.
 2019
 31-40 C p. 87-96
 artikel
4069 Sufficient conditions for k -factors and spanning trees of graphs Ao, Guoyan
31-40 C p. 124-135
 artikel
4070 Sufficient conditions for k -leaf-connected graphs in terms of the first Zagreb index, the reciprocal degree distance and the forgotten topological index An, Mingqiang
31-40 C p. 74-80
 artikel
4071 Sufficient conditions for properly colored C 3 ’s and C 4 ’s in edge-colored complete graphs Han, Tingting
31-40 C p. 101-109
 artikel
4072 Sufficient conditions for 2-rainbow connected graphs Kemnitz, Arnfried
 2016
 31-40 C p. 247-250
4 p.
 artikel
4073 Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs Chen, Zhibing
 2017
 31-40 C p. 64-70
7 p.
 artikel
4074 Sufficient sparseness conditions for G 2 to be ( Δ + 1 ) -choosable, when Δ ≥ 5 Cranston, Daniel W.
 2014
 31-40 C p. 167-176
10 p.
 artikel
4075 Sum-free cyclic multi-bases and constructions of Ramsey algebras Alm, Jeremy F.
 2015
 31-40 C p. 204-212
9 p.
 artikel
4076 Sum index and difference index of graphs Harrington, Joshua
31-40 C p. 262-283
 artikel
4077 Sum of weighted distances in trees Cai, Qingqiong
 2019
 31-40 C p. 67-84
 artikel
4078 Sum-perfect graphs Litjens, Bart
 2019
 31-40 C p. 232-239
 artikel
4079 Super connectivity of folded twisted crossed cubes Guo, Litao
31-40 C p. 56-63
 artikel
4080 Super domination: Graph classes, products and enumeration Ghanbari, Nima
31-40 C p. 8-24
 artikel
4081 Super edge-connectivity of dense digraphs and graphs Soneoka, Terunao
 1992
 31-40 C p. 511-523
13 p.
 artikel
4082 Supereulerian graphs with small circumference and 3-connected hamiltonian claw-free graphs Ma, Xiaoling
 2016
 31-40 C p. 111-130
20 p.
 artikel
4083 Supereulerian graphs with width s and s -collapsible graphs Li, Ping
 2016
 31-40 C p. 79-94
16 p.
 artikel
4084 Supereulerian of regular matroids with cogirth conditions Qin, Xiaoxiao
31-40 C p. 327-334
 artikel
4085 Super graphs on groups, II Arunkumar, G.
31-40 C p. 371-382
 artikel
4086 Super-simple ( v , 4 , 2 ) directed designs and a lower bound for the minimum size of their defining set Boostan, M.
 2016
 31-40 C p. 14-23
10 p.
 artikel
4087 Surface embedding of ( n , k ) -extendable graphs Lu, Hongliang
 2014
 31-40 C p. 163-173
11 p.
 artikel
4088 SVD, discrepancy, and regular structure of contingency tables Bolla, Marianna
31-40 C p. 3-11
 artikel
4089 Sylvester power and weighted sums on the Frobenius set in arithmetic progression Komatsu, Takao
31-40 C p. 110-126
 artikel
4090 Symmetric property and reliability of locally twisted cubes Chang, Xuenan
31-40 C p. 257-269
 artikel
4091 Symmetric property and the bijection between perfect matchings and sub-hypercubes of enhanced hypercubes Xu, Liqiong
31-40 C p. 41-45
 artikel
4092 Symmetric unique neighbor expanders and good LDPC codes Becker, Oren
 2016
 31-40 C p. 211-216
6 p.
 artikel
4093 Synchronizing dynamic Huffman codes Klein, Shmuel T.
31-40 C p. 23-32
 artikel
4094 Synchronizing sequences for road colored digraphs Grech, Mariusz
31-40 C p. 128-140
 artikel
4095 Synthesizing cubes to satisfy a given intersection pattern Qian, Weikang
 2015
 31-40 C p. 11-38
28 p.
 artikel
4096 System of unbiased representatives for a collection of bicolorings Balachandran, Niranjan
31-40 C p. 116-127
 artikel
4097 Table of large (Δ,D)-graphs Bermond, J.-C.
 1992
 31-40 C p. 575-577
3 p.
 artikel
4098 Target set selection for conservative populations Feige, Uriel
31-40 C p. 119-132
 artikel
4099 Target set selection with maximum activation time Keiler, Lucas
31-40 C p. 199-217
 artikel
4100 Techniques of graphs in the study of the structure of graded modules Calderón Martín, Antonio J.
 2019
 31-40 C p. 79-87
 artikel
4101 Template-driven rainbow coloring of proper interval graphs Chandran, L. Sunil
31-40 C p. 97-107
 artikel
4102 Terminal-pairability in complete bipartite graphs Colucci, Lucas
 2018
 31-40 C p. 459-463
 artikel
4103 Testing popularity in linear time via maximum matching Bérczi-Kovács, Erika
31-40 C p. 152-160
 artikel
4104 10th Andalusian Meeting on Discrete Mathematics González Yero, Ismael
 2019
 31-40 C p. 1
 artikel
4105 12th Cologne-Twente workshop on graphs and combinatorial optimization (CTW 2013) Hurink, Johann
 2015
 31-40 C p. 1-
1 p.
 artikel
4106 14th Cologne-Twente Workshop on Graphs and CombinatorialOptimization (CTW 2016) Ceselli, Alberto
 2019
 31-40 C p. 1
 artikel
4107 The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 Cheng, Xiaohan
31-40 C p. 29-39
 artikel
4108 The advantage of truncated permutations Gilboa, Shoni
31-40 C p. 214-223
 artikel
4109 The algorithm and complexity of secure domination in 3-dimensional box graphs Wang, Cai-Xia
31-40 C p. 63-74
 artikel
4110 The anti-adjacency matrix of a graph: Eccentricity matrix Wang, Jianfeng
 2018
 31-40 C p. 299-309
 artikel
4111 The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets Dannenberg, Katharina
 2019
 31-40 C p. 101-114
 artikel
4112 The arithmetic-periodicity of cut for C = { 1 , 2 c } Ellis, Paul
31-40 C p. 391-403
 artikel
4113 The assignment problem with nearly Monge arrays and incompatible partner indices Weiß, C.
 2016
 31-40 C p. 183-203
21 p.
 artikel
4114 The asymptotic behavior of (degree-)Kirchhoff indices of iterated total graphs of regular graphs Tian, Gui-Xian
 2017
 31-40 C p. 224-230
7 p.
 artikel
4115 The asymptotic optimality of spider-web networks Pippenger, Nicholas
 1992
 31-40 C p. 437-450
14 p.
 artikel
4116 The asymptotic value of graph energy for random graphs with degree-based weights Li, Xueliang
31-40 C p. 481-488
 artikel
4117 The average expected value of a rooted graph, Monte Carlo calculation, and a power index for the voting game Hachimori, Masahiro
31-40 C p. 74-86
 artikel
4118 The average Laplacian polynomial of a graph Zhang, Yanan
31-40 C p. 737-743
 artikel
4119 The average order of a connected vertex set in generalized ladder graphs Ma, Hongxia
31-40 C p. 402-413
 artikel
4120 The average reliability of a graph Brown, J.I.
 2014
 31-40 C p. 19-33
15 p.
 artikel
4121 The average Steiner ( 3 , 2 ) -eccentricity of trees Li, Gengji
31-40 C p. 74-87
 artikel
4122 The axiomatic characterization of the interval function of distance hereditary graphs Changat, Manoj
31-40 C p. 62-70
 artikel
4123 The balanced connected subgraph problem Bhore, Sujoy
31-40 C p. 111-120
 artikel
4124 The balanced maximally diverse grouping problem with attribute values Schulz, Arne
31-40 C p. 82-103
 artikel
4125 The b -branching problem in digraphs Kakimura, Naonori
31-40 C p. 565-576
 artikel
4126 The b-chromatic index of direct product of graphs Koch, Ivo
 2015
 31-40 C p. 109-117
9 p.
 artikel
4127 The b -chromatic number and f -chromatic vertex number of regular graphs El Sahili, Amine
 2014
 31-40 C p. 79-85
7 p.
 artikel
4128 The b-chromatic number and related topics—A survey Jakovac, Marko
 2018
 31-40 C p. 184-201
 artikel
4129 The biclique partitioning polytope de Sousa Filho, Gilberto F.
31-40 C p. 118-130
 artikel
4130 The Bin Packing Problem with Item Fragmentation:A worst-case analysis Bertazzi, Luca
 2019
 31-40 C p. 63-77
 artikel
4131 The bipartite unconstrained 0–1 quadratic programming problem: Polynomially solvable cases Punnen, Abraham P.
 2015
 31-40 C p. 1-10
10 p.
 artikel
4132 The b -Matching problem in distance-hereditary graphs and beyond Ducoffe, Guillaume
31-40 C p. 233-246
 artikel
4133 The boundary of a graph and its isoperimetric inequality Steinerberger, Stefan
31-40 C p. 125-134
 artikel
4134 The Brown–Erdős–Sós conjecture in finite abelian groups Solymosi, József
31-40 C p. 155-160
 artikel
4135 The Capacitated Orienteering Problem Bock, Adrian
 2015
 31-40 C p. 31-42
12 p.
 artikel
4136 The Carathéodory number of the P 3 convexity of chordal graphs Coelho, Erika M.M.
 2014
 31-40 C p. 104-108
5 p.
 artikel
4137 The caterpillar-packing polytope Marenco, Javier
 2018
 31-40 C p. 4-15
 artikel
4138 The challenges of unbounded treewidth in parameterised subgraph counting problems Meeks, Kitty
 2016
 31-40 C p. 170-194
25 p.
 artikel
4139 The change of Seidel energy of 5-partite Turán graph due to edge deletion Liu, Yayang
31-40 C p. 104-123
 artikel
4140 The changes in distance Laplacian spectral radius of graphs resulting from graft transformations Lin, Hongying
 2017
 31-40 C p. 147-157
11 p.
 artikel
4141 The channel capacity of read/write isolated memory Wang, Chuanlong
 2016
 31-40 C p. 264-273
10 p.
 artikel
4142 The characteristic polynomial of a graph containing loops Sinha, Deepa
31-40 C p. 97-106
 artikel
4143 The chromatic discrepancy of graphs Aravind, N.R.
 2015
 31-40 C p. 40-49
10 p.
 artikel
4144 The chromatic number of odd-hole-free graphs Chen, Rong
31-40 C p. 84-87
 artikel
4145 The chromatic number of signed graphs with bounded maximum average degree Jacques, Fabien
31-40 C p. 43-59
 artikel
4146 The circular chromatic number of signed series–parallel graphs of given girth Zhu, Jialu
31-40 C p. 82-92
 artikel
4147 The Clar and Fries structures of a fullerene I Graver, Jack E.
 2016
 31-40 C p. 112-125
14 p.
 artikel
4148 The clique distribution in powers of hypercubes Kou, Yongfang
31-40 C p. 76-85
 artikel
4149 The clique number of the exact distance t -power graph: Complexity and eigenvalue bounds Abiad, Aida
31-40 C p. 55-70
 artikel
4150 The clique problem with multiple-choice constraints under a cycle-free dependency graph Bärmann, Andreas
31-40 C p. 59-77
 artikel
4151 The combinatorics of Motzkin polyominoes Baril, Jean-Luc
31-40 C p. 1-15
 artikel
4152 The combinatorics of tandem duplication Penso-Dolfin, L.
 2015
 31-40 C p. 1-22
22 p.
 artikel
4153 The competition graphs of oriented complete bipartite graphs Kim, Suh-Ryung
 2016
 31-40 C p. 182-190
9 p.
 artikel
4154 The competition hypergraphs of doubly partial orders Kim, Suh-Ryung
 2014
 31-40 C p. 185-191
7 p.
 artikel
4155 The completely independent spanning trees in P 4 -free graphs Yuan, Jun
31-40 C p. 573-585
 artikel
4156 The complete set of minimal simple graphs that support unsatisfiable 2-CNFs Karve, Vaibhav
31-40 C p. 123-132
 artikel
4157 The complexity of AND—decomposition of Boolean functions Emelyanov, Pavel
31-40 C p. 113-132
 artikel
4158 The complexity of cluster vertex splitting and company Firbas, Alexander
31-40 C p. 190-207
 artikel
4159 The complexity of finding arc-disjoint branching flows Bang-Jensen, J.
 2016
 31-40 C p. 16-26
11 p.
 artikel
4160 The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem Dantas, Simone
 2015
 31-40 C p. 15-24
10 p.
 artikel
4161 The complexity of gerrymandering over graphs: Paths and trees Bentert, Matthias
31-40 C p. 103-112
 artikel
4162 The complexity of 2-intersection graphs of 3-hypergraphs recognition for claw-free graphs and triangulated claw-free graphs Di Marco, N.
31-40 C p. 232-246
 artikel
4163 The complexity of pebbling reachability and solvability in planar and outerplanar graphs Lewis, Timothy
 2014
 31-40 C p. 62-74
13 p.
 artikel
4164 The complexity of recognizing minimally tough graphs Katona, Gyula Y.
31-40 C p. 55-84
 artikel
4165 The complexity of register allocation Krause, Philipp Klaus
 2014
 31-40 C p. 51-59
9 p.
 artikel
4166 The complexity of restricted star colouring M.A., Shalu
31-40 C p. 327-350
 artikel
4167 The complexity of solution-free sets of integers for general linear equations Edwards, Keith J.
 2019
 31-40 C p. 115-133
 artikel
4168 The complexity of spanning tree problems involving graphical indices Dong, Yanni
31-40 C p. 143-154
 artikel
4169 The complexity of the falsifiability problem for pure implicational formulas Heusch, Peter
 1999
 31-40 C p. 127-138
12 p.
 artikel
4170 The complexity of tropical graph homomorphisms Foucaud, Florent
 2017
 31-40 C p. 64-81
18 p.
 artikel
4171 The computational complexity of the backbone coloring problem for planar graphs with connected backbones Janczewski, Robert
 2015
 31-40 C p. 237-242
6 p.
 artikel
4172 The computational complexity of three graph problems for instances with bounded minors of constraint matrices Gribanov, D.V.
 2017
 31-40 C p. 13-20
 artikel
4173 The cone of supermodular games on finite distributive lattices Grabisch, Michel
 2019
 31-40 C p. 144-154
 artikel
4174 The connected facility location polytope Leitner, Markus
 2018
 31-40 C p. 151-167
 artikel
4175 The connection between polynomial optimization, maximum cliques and Turán densities Wu, Biao
 2017
 31-40 C p. 114-121
8 p.
 artikel
4176 The connectivity and the Harary index of a graph Li, Xiao-Xin
 2015
 31-40 C p. 167-173
7 p.
 artikel
4177 The connectivity of hierarchical Cayley digraphs Hamidoune, Y.O.
 1992
 31-40 C p. 275-280
6 p.
 artikel
4178 The constrained Bottleneck Spanning Tree Problem with upgrades Coulier, Bryan
31-40 C p. 12-28
 artikel
4179 The construction of a smallest unstable asymmetric graph and a family of unstable asymmetric graphs with an arbitrarily high index of instability Lauri, J.
 2019
 31-40 C p. 85-91
 artikel
4180 The contour of a bridged graph is geodetic Mezzini, Mauro
 2016
 31-40 C p. 213-215
3 p.
 artikel
4181 The convexity of induced paths of order three and applications: Complexity aspects Araújo, Rafael T.
 2018
 31-40 C p. 33-42
 artikel
4182 The co-secure domination in proper interval graphs Zou, Yun-Hao
31-40 C p. 68-71
 artikel
4183 The cost of perfection for matchings in graphs Brazil, E.V.
 2016
 31-40 C p. 112-122
 artikel
4184 The covering radius of Hadamard codes in odd graphs Solé, Patrick
 1992
 31-40 C p. 501-510
10 p.
 artikel
4185 The cross-correlation measure of families of finite binary sequences: Limiting distributions and minimal values Mérai, László
 2016
 31-40 C p. 153-168
16 p.
 artikel
4186 The crossing number of locally twisted cubes L T Q n Lingqi, Zhao
31-40 C p. 407-418
 artikel
4187 The cyclic diagnosability of Cayley graphs generated by transposition trees Zheng, Weixing
31-40 C p. 109-123
 artikel
4188 The cyclic diagnosability of star graphs under the PMC and MM* models Mei, Liu
31-40 C p. 60-73
 artikel
4189 The Cyclic Towers of Antwerpen problem—A challenging Hanoi variant Minsker, Steven
 2014
 31-40 C p. 44-53
10 p.
 artikel
4190 The decycling number of generalized Petersen graphs Gao, Liqing
 2015
 31-40 C p. 297-300
4 p.
 artikel
4191 The 6-degeneracy of 1-planar graphs Wu, Qingqin
31-40 C p. 225-234
 artikel
4192 The Degree/Diameter Problem for mixed abelian Cayley graphs López, Nacho
 2017
 31-40 C p. 190-197
8 p.
 artikel
4193 The (degree-) Kirchhoff indices in random polygonal chains Li, Jiajian
31-40 C p. 63-75
 artikel
4194 The degree resistance distance of cacti Du, Junfeng
 2015
 31-40 C p. 16-24
9 p.
 artikel
4195 The degree sequence of the preferential attachment model Yu, Lu
31-40 C p. 158-167
 artikel
4196 The diagnosability of interconnection networks Wang, Mujiangshan
31-40 C p. 413-428
 artikel
4197 The diameter of strong orientations of Cartesian products of graphs Špacapan, Simon
31-40 C p. 116-121
 artikel
4198 The difference between remoteness and radius of a graph Hua, Hongbo
 2015
 31-40 C p. 103-110
8 p.
 artikel
4199 The difference between several metric dimension graph invariants Milivojević Danas, Milica
31-40 C p. 1-6
 artikel
4200 The differential of the line graph L ( G ) Basilio, Ludwin A.
31-40 C p. 82-89
 artikel
4201 The difficulty of beating the Taxman Franklín, Atli Fannar
31-40 C p. 166-171
 artikel
4202 The digrundy number of digraphs Araujo-Pardo, Gabriela
31-40 C p. 117-123
 artikel
4203 The Discrete Moment Method for the numerical integration of piecewise higher order convex functions Prékopa, András
 2016
 31-40 C p. 151-162
12 p.
 artikel
4204 The discrete separation theorem and price adjustment directions in markets with heterogeneous commodities Yokote, Koji
31-40 C p. 134-143
 artikel
4205 The distance-edge-monitoring numbers of subdivision graphs Ji, Zhen
31-40 C p. 37-47
 artikel
4206 The distance matrix of caterpillar do Nascimento, Joice S.
 2019
 31-40 C p. 141-152
 artikel
4207 The Distance Orientation Problem Scheffler, Robert
31-40 C p. 324-342
 artikel
4208 The domination number of the graph defined by two levels of the n -cube Badakhshian, Leila
 2019
 31-40 C p. 30-37
 artikel
4209 The double competition hypergraph of a digraph Park, Jeongmi
 2015
 31-40 C p. 110-113
4 p.
 artikel
4210 The D -representation of nonnegative integers and the Fibonacci factorization of suffixes of infinite Fibonacci words Chuan, Wai-Fong
 2014
 31-40 C p. 71-83
13 p.
 artikel
4211 The dual Lovász extension operator and the Shapley extension operator for TU games Casajus, André
31-40 C p. 224-232
 artikel
4212 The Dudeney–Stockmeyer Conjecture Hinz, Andreas M.
31-40 C p. 19-26
 artikel
4213 The eccentricity matrix of a digraph Yang, Xiuwen
31-40 C p. 61-73
 artikel
4214 The edge fault-tolerance about the strong Menger edge-connectivity of order r among hamming graph Zhang, Mingzu
31-40 C p. 322-330
 artikel
4215 The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree Qiao, Hongwei
31-40 C p. 174-181
 artikel
4216 The edge-Wiener index and the edge-hyper-Wiener index of phenylenes Pleteršek, Petra Žigert
 2019
 31-40 C p. 326-333
 artikel
4217 The effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edge Xiao, Peng
31-40 C p. 444-455
 artikel
4218 The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph Hu, Shenglong
 2014
 31-40 C p. 140-151
12 p.
 artikel
4219 The e -positivity and Schur positivity of some spiders and broom trees Wang, David G.L.
31-40 C p. 226-240
 artikel
4220 The Erdős webgraph server Ördög, Rafael
 2014
 31-40 C p. 315-317
3 p.
 artikel
4221 The existence of a { K 1 , 2 , K 1 , 3 , K 5 } -factor based on the size or the A α -spectral radius of graphs Zhang, Xianglong
31-40 C p. 22-30
 artikel
4222 The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality Fukuzono, Naoka
31-40 C p. 281-294
 artikel
4223 The existence of f -forests and f -trees in graphs Furuya, Michitaka
 2019
 31-40 C p. 113-123
 artikel
4224 The expanding search ratio of a graph Angelopoulos, Spyros
 2019
 31-40 C p. 51-65
 artikel
4225 The expected subtree number index in random polyphenylene and spiro chains Yang, Yu
31-40 C p. 483-492
 artikel
4226 The expected values for the Kirchhoff indices in the random cyclooctatetraene and spiro chains Qi, Jinfeng
31-40 C p. 240-249
 artikel
4227 The expected values for the Kirchhoff indices in the random hexagonal-quadrilateral chain and its spiro chain Qin, Wei
31-40 C p. 150-163
 artikel
4228 The expected values for the Schultz index, Gutman index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain Zhang, Leilei
31-40 C p. 243-256
 artikel
4229 The expected values of Wiener indices in random polycyclic chains Chen, Hanlin
31-40 C p. 104-109
 artikel
4230 The exponential growth of the packing chromatic number of iterated Mycielskians Bidine, Ez-Zobair
31-40 C p. 232-241
 artikel
4231 The extendability of Cayley graphs generated by transpositions Feng, Yong-De
31-40 C p. 134-139
 artikel
4232 The 3-extra conditional diagnosability of balanced hypercubes under MM ∗ model Li, Lili
31-40 C p. 310-316
 artikel
4233 The fast robber on interval and chordal graphs Mehrabian, Abbas
 2015
 31-40 C p. 188-193
6 p.
 artikel
4234 The fast search number of a Cartesian product of graphs Xue, Yuan
 2017
 31-40 C p. 106-119
14 p.
 artikel
4235 The fault-diameter and wide-diameter of twisted hypercubes Qi, Hao
 2018
 31-40 C p. 154-160
 artikel
4236 The fault tolerance of ( n , k ) -bubble-sort networks Zhao, Shu-Li
31-40 C p. 204-211
 artikel
4237 The feasibility problem for line graphs Caro, Yair
31-40 C p. 167-180
 artikel
4238 The flip Markov chain for connected regular graphs Cooper, Colin
 2019
 31-40 C p. 56-79
 artikel
4239 The forwarding index of communication networks with given connectivity de la Vega, W.Fernandez
 1992
 31-40 C p. 147-155
9 p.
 artikel
4240 The fractional strong metric dimension in three graph products Kang, Cong X.
 2018
 31-40 C p. 190-203
 artikel
4241 The fully weighted toughness of a graph Goddard, Wayne
31-40 C p. 82-90
 artikel
4242 The game chromatic index of some trees of maximum degree 4 Chan, Wai Hong
 2014
 31-40 C p. 1-6
6 p.
 artikel
4243 The game of Cops and Robber on circulant graphs Fitzpatrick, Shannon L.
 2017
 31-40 C p. 64-73
10 p.
 artikel
4244 The gap between the rank of a complex unit gain graph and its underlying graph Du, Kexin
31-40 C p. 399-412
 artikel
4245 The Gateway Location Problem: Assessing the impact of candidate site selection policies Bruglieri, Maurizio
 2014
 31-40 C p. 96-111
16 p.
 artikel
4246 The generalized connectivity of alternating group graphs and ( n , k ) -star graphs Zhao, Shu-Li
 2018
 31-40 C p. 310-321
 artikel
4247 The generalized 4-connectivity of burnt pancake graphs Wang, Jing
31-40 C p. 93-114
 artikel
4248 The generalized 4-connectivity of hierarchical cubic networks Zhao, Shu-Li
31-40 C p. 194-206
 artikel
4249 The generalized 4-connectivity of hypercubes Lin, Shangwei
 2017
 31-40 C p. 60-67
8 p.
 artikel
4250 The generalized 4-connectivity of pancake graphs Zhao, Shu-Li
31-40 C p. 77-86
 artikel
4251 The generalized matcher game Bachstein, Anna
31-40 C p. 444-453
 artikel
4252 The generalized microscopic image reconstruction problem Bar-Noy, Amotz
31-40 C p. 402-416
 artikel
4253 The general position achievement game played on graphs Klavžar, Sandi
31-40 C p. 109-116
 artikel
4254 The geometric–arithmetic index and the chromatic number of connected graphs Aouchiche, Mustapha
 2017
 31-40 C p. 207-212
 artikel
4255 The Geometric–Arithmetic index of trees with a given total domination number Bermudo, Sergio
31-40 C p. 99-113
 artikel
4256 The 1-good-neighbor connectivity and diagnosability of Cayley graphs generated by complete graphs Wang, Mujiangshan
 2018
 31-40 C p. 108-118
 artikel
4257 The 1-good neighbor connectivity of unidirectional star graph networks Li, Chunfang
31-40 C p. 1-11
 artikel
4258 The Gowers U 3 norm of one family of cubic power permutations Li, Zhaole
31-40 C p. 208-222
 artikel
4259 The Graovac-Pisanski index of Sierpiński graphs Fathalikhani, Khadijeh
31-40 C p. 30-42
 artikel
4260 The graph energy game Arizmendi, Gerardo
31-40 C p. 128-140
 artikel
4261 The Graph Motif problem parameterized by the structure of the input graph Bonnet, Édouard
 2017
 31-40 C p. 78-94
17 p.
 artikel
4262 The graphs cospectral with the pineapple graph Topcu, Hatice
 2019
 31-40 C p. 52-59
 artikel
4263 The graph spectra and spectral moments of random graphs Ghanooni, Naghmeh
 2019
 31-40 C p. 32-40
 artikel
4264 The greatest values for atom-bond sum-connectivity index of graphs with given parameters Li, Fengwei
31-40 C p. 188-196
 artikel
4265 The Hamilton Cycle Problem for locally traceable and locally hamiltonian graphs de Wet, Johan P.
 2019
 31-40 C p. 291-308
 artikel
4266 The Hamming distances of repeated-root cyclic codes of length 5 p s Li, Xia
31-40 C p. 29-41
 artikel
4267 The harmonic index of a graph and its DP-chromatic number Lv, Jian-Bo
31-40 C p. 611-615
 artikel
4268 The height and width of bargraphs Blecher, Aubrey
 2015
 31-40 C p. 36-44
9 p.
 artikel
4269 The hexagonal chains with the first three maximal Mostar indices Xiao, Qiqi
31-40 C p. 180-191
 artikel
4270 The h -extra connectivity and h -extra conditional diagnosability of Bubble-sort star graphs Zhu, Q.
 2018
 31-40 C p. 322-333
 artikel
4271 The H -force set of a hypertournament Li, Ruijuan
 2014
 31-40 C p. 168-175
8 p.
 artikel
4272 The hierarchy of circuit diameters and transportation polytopes Borgwardt, S.
 2018
 31-40 C p. 8-24
 artikel
4273 The high order spectral extremal results for graphs and their applications Liu, Chunmeng
31-40 C p. 209-214
 artikel
4274 The Horn renamability, q-Horn and SLUR threshold for random k -CNF formulas Chao, D.
 2015
 31-40 C p. 44-51
8 p.
 artikel
4275 The Hosoya polynomial of distance-regular graphs Deutsch, Emeric
 2014
 31-40 C p. 153-156
4 p.
 artikel
4276 The h -restricted connectivity of balanced hypercubes Cheng, Dongqin
31-40 C p. 133-141
 artikel
4277 The inclusion-free edge-colorings of ( 3 , Δ ) -bipartite graphs Chen, Lily
31-40 C p. 159-164
 artikel
4278 The α -index of graphs without intersecting triangles/quadrangles as a minor Zhang, Yanting
31-40 C p. 324-335
 artikel
4279 The interactive sum choice number of graphs Bonamy, Marthe
31-40 C p. 72-84
 artikel
4280 The interior and exterior polynomials are well-defined Guan, Xiaxia
31-40 C p. 246-253
 artikel
4281 The Intermediate Price of Anarchy ( I P o A ) in bin packing games Dosa, Gyorgy
 2018
 31-40 C p. 16-25
 artikel
4282 The intermittent diagnosability for two families of interconnection networks under the PMC model and MM* model Guo, Chen
31-40 C p. 89-106
 artikel
4283 The intersection spectrum of hooked Skolem sequences and applications Shalaby, Nabil
 2014
 31-40 C p. 239-260
22 p.
 artikel
4284 The interval coloring impropriety of planar graphs Lee, Seunghun
31-40 C p. 88-91
 artikel
4285 The interval structure of ( 0 , 1 ) -matrices Brualdi, Richard A.
 2019
 31-40 C p. 3-15
 artikel
4286 The iterated local model for social networks Bonato, Anthony
31-40 C p. 556-571
 artikel
4287 The iterated local transitivity model for hypergraphs Behague, Natalie C.
31-40 C p. 106-119
 artikel
4288 The iterative independent model Meger, Erin
31-40 C p. 242-256
 artikel
4289 The joint weight enumerator of an LCD code and its dual Alahmadi, Adel
 2019
 31-40 C p. 12-18
 artikel
4290 The k -centrum Chinese Postman delivery problem and a related cost allocation game Granot, Daniel
 2014
 31-40 C p. 100-108
9 p.
 artikel
4291 The κ k -connectivity of line graphs Li, Hengzhe
31-40 C p. 1-8
 artikel
4292 The k -general d -position problem for graphs Cody, Brent
31-40 C p. 135-151
 artikel
4293 The Kirchhoff index and spanning trees of Möbius/cylinder octagonal chain Liu, Jia-Bao
31-40 C p. 22-31
 artikel
4294 The Kirchhoff index of subdivisions of graphs Yang, Yujun
 2014
 31-40 C p. 153-157
5 p.
 artikel
4295 The ( k , ℓ ) partitioned probe problem: NP-complete versus polynomial dichotomy Dantas, Simone
 2018
 31-40 C p. 67-75
 artikel
4296 The k -path vertex cover of rooted product graphs Jakovac, Marko
 2015
 31-40 C p. 111-119
9 p.
 artikel
4297 The k -rainbow bondage number of a graph Dehgardi, N.
 2014
 31-40 C p. 133-139
7 p.
 artikel
4298 The k -regular induced subgraph problem Agra, Agostinho
 2017
 31-40 C p. 14-30
17 p.
 artikel
4299 The Laplacian characteristic polynomial of the path-tree of the complete graph Zhou, Jinqiu
31-40 C p. 308-313
 artikel
4300 The Laplacian spectral moments of uniform hypergraphs Liu, Jueru
31-40 C p. 91-99
 artikel
4301 The largest eigenvalue of C − k -free signed graphs Wang, Yongang
31-40 C p. 164-172
 artikel
4302 The leaf-free graphs with nullity 2 c ( G ) − 1 Chang, Sarula
31-40 C p. 44-54
 artikel
4303 The least Euclidean distortion constant of a distance-regular graph Cioabă, Sebastian M.
31-40 C p. 212-225
 artikel
4304 The level matrix of a tree and its spectrum Dossou-Olory, Audace A.V.
31-40 C p. 1-12
 artikel
4305 The limiting behaviours for the Gutman index, Schultz index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain Zhang, Jinlian
31-40 C p. 62-73
 artikel
4306 The linear 2-arboricity of IC-planar graphs Liu, Juan
31-40 C p. 1-7
 artikel
4307 The linear arboricity of K 5 -minor free graphs Yang, Fan
31-40 C p. 49-60
 artikel
4308 The linear chromatic number of a Sperner family Akhtar, Reza
 2014
 31-40 C p. 1-8
8 p.
 artikel
4309 The list distinguishing number of Kneser graphs Balachandran, Niranjan
 2018
 31-40 C p. 30-41
 artikel
4310 The list r-hued coloring of Halin graph Lu, Shudan
31-40 C p. 32-42
 artikel
4311 The list r -hued coloring of K m , n Tang, Meng
31-40 C p. 159-164
 artikel
4312 The list scheduling algorithm for scheduling unreliable jobs on two parallel machines Agnetis, Alessandro
 2014
 31-40 C p. 2-11
10 p.
 artikel
4313 The localization game on Cartesian products Boshoff, Jeandré
31-40 C p. 247-259
 artikel
4314 The localization game on oriented graphs Bonato, Anthony
31-40 C p. 145-157
 artikel
4315 The lower bound of the weightwise nonlinearity profile of a class of weightwise perfectly balanced functions Su, Sihong
31-40 C p. 60-70
 artikel
4316 The L ( p , q ) -labelling of planar graphs without 4-cycles Zhu, Haiyang
 2014
 31-40 C p. 355-363
9 p.
 artikel
4317 The LPT heuristic for minimizing total load on a proportionate openshop Gerstl, Enrique
31-40 C p. 190-198
 artikel
4318 The majority game with an arbitrary majority Britnell, John R.
 2016
 31-40 C p. 1-6
6 p.
 artikel
4319 The Maker–Maker domination game in forests Duchêne, Eric
31-40 C p. 6-34
 artikel
4320 The matcher game played in graphs Goddard, Wayne
 2018
 31-40 C p. 82-88
 artikel
4321 The matching energy of graphs with given parameters Li, Shuli
 2014
 31-40 C p. 415-420
6 p.
 artikel
4322 The matching energy of random graphs Chen, Xiaolin
 2015
 31-40 C p. 102-109
8 p.
 artikel
4323 The matching polynomial of the path-tree of a complete graph Guo, Mingxu
31-40 C p. 244-249
 artikel
4324 The matching relaxation for a class of generalized set partitioning problems Samer, Phillippe
 2019
 31-40 C p. 153-166
 artikel
4325 The max-flow min-cut property and ± 1 -resistant sets Abdi, Ahmad
31-40 C p. 455-476
 artikel
4326 The maximum atom-bond connectivity index for graphs with edge-connectivity one Cui, Qing
 2017
 31-40 C p. 170-173
4 p.
 artikel
4327 The maximum 2D subarray polytope: Facet-inducing inequalities and polyhedral computations Koch, Ivo
31-40 C p. 286-301
 artikel
4328 The maximum infection time of the P 3 convexity in graphs with bounded maximum degree Marcilon, Thiago
 2018
 31-40 C p. 245-257
 artikel
4329 The maximum matching energy of bicyclic graphs with even girth Ma, Gang
 2016
 31-40 C p. 203-210
8 p.
 artikel
4330 The maximum matching extendability and factor-criticality of 1-planar graphs Zhang, Jiangyue
31-40 C p. 247-254
 artikel
4331 The maximum α -spectral radius and the majorization theorem of k -uniform supertrees You, Lihua
31-40 C p. 663-675
 artikel
4332 The maximum vertex coverage problem on bipartite graphs Apollonio, Nicola
 2014
 31-40 C p. 37-48
12 p.
 artikel
4333 The median function of a block graph: Axiomatic characterizations Changat, Manoj
31-40 C p. 246-259
 artikel
4334 The median of Sierpiński graphs Balakrishnan, Kannan
31-40 C p. 159-170
 artikel
4335 The micro-world of cographs Alecu, Bogdan
31-40 C p. 3-14
 artikel
4336 The minimum ABC index of chemical trees Gao, Wei
31-40 C p. 132-143
 artikel
4337 The minimum chromatic violation problem: A polyhedral approach Braga, M.
31-40 C p. 69-80
 artikel
4338 The minimum degree Group Steiner problem Kortsarz, Guy
31-40 C p. 229-239
 artikel
4339 The Minimum Flow Cost Hamiltonian Cycle Problem: A comparison of formulations Ortiz-Astorquiza, Camilo
 2015
 31-40 C p. 140-154
15 p.
 artikel
4340 The minimum Kirchhoff index of phenylene chains Zhang, Leilei
31-40 C p. 69-75
 artikel
4341 The minimum number of minimal codewords in an [ n , k ] -code and in graphic codes Alahmadi, A.
 2015
 31-40 C p. 32-39
8 p.
 artikel
4342 The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree Yang, Weihua
 2014
 31-40 C p. 304-309
6 p.
 artikel
4343 The minimum second Zagreb eccentricity index of graphs with parameters Hayat, Fazal
31-40 C p. 307-316
 artikel
4344 The minimum size of graphs satisfying cut conditions Jobson, Adam S.
 2018
 31-40 C p. 89-96
 artikel
4345 The minimum span of L ( 2 , 1 ) -labelings of generalized flowers Karst, Nathaniel
 2015
 31-40 C p. 139-151
13 p.
 artikel
4346 The minor minimal intrinsically chiral graphs Choi, Howon
31-40 C p. 237-245
 artikel
4347 The multicolored graph realization problem Díaz, Josep
31-40 C p. 146-159
 artikel
4348 The multi-returning secretary problem Bayón, L.
31-40 C p. 33-46
 artikel
4349 The Multi-SAT algorithm Gu, Jun
 1999
 31-40 C p. 111-126
16 p.
 artikel
4350 The Multi-Spreader Crane Scheduling Problem: Partitions and supersequences Cheng, Christine T.
31-40 C p. 207-218
 artikel
4351 The multi-terminal vertex separator problem: Branch-and-Cut-and-Price Magnouche, Y.
31-40 C p. 86-111
 artikel
4352 The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut Cornaz, D.
 2019
 31-40 C p. 11-37
 artikel
4353 The n -ary initial literal and literal shuffle Hoffmann, Stefan
31-40 C p. 112-132
 artikel
4354 The New Periodicity Lemma revisited Bai, Haoyue
 2016
 31-40 C p. 30-36
7 p.
 artikel
4355 The niche graphs of bipartite tournaments Eoh, Soogang
31-40 C p. 86-95
 artikel
4356 The NL-flow polynomial Altenbokum, Barbara
31-40 C p. 193-202
 artikel
4357 The no-meet matroid Ben-Ameur, Walid
31-40 C p. 94-107
 artikel
4358 The non-positive circuit weight problem in parametric graphs: A solution based on dioid theory Zorzenon, Davide
31-40 C p. 56-70
 artikel
4359 The normalized Laplacian, degree-Kirchhoff index and the spanning tree numbers of generalized phenylenes Zhu, Zhongxun
 2019
 31-40 C p. 256-267
 artikel
4360 The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains Huang, Jing
 2016
 31-40 C p. 67-79
13 p.
 artikel
4361 The number of affine equivalent classes and extended affine equivalent classes of vectorial Boolean functions Chen, Xi
31-40 C p. 477-491
 artikel
4362 The number of completely different optimal identifying codes in the infinite square grid Pelto, Mikko
 2017
 31-40 C p. 143-158
16 p.
 artikel
4363 The number of dissociation sets in connected graphs Yuan, Bo-Jun
31-40 C p. 196-203
 artikel
4364 The number of maximal independent sets in trees with a given number of leaves Taletskii, D.S.
31-40 C p. 321-330
 artikel
4365 The number of nonisomorphic nonorientable 6-gonal embeddings of complete graphs Korzhik, Vladimir P.
31-40 C p. 122-128
 artikel
4366 The number of P-vertices for acyclic matrices of maximum nullity Du, Zhibin
 2019
 31-40 C p. 211-219
 artikel
4367 The number of ribbon tilings for strips Chen, Yinsong
31-40 C p. 85-103
 artikel
4368 The number of spanning trees in Apollonian networks Zhang, Zhongzhi
 2014
 31-40 C p. 206-213
8 p.
 artikel
4369 The number of spanning trees of a family of 2-separable weighted graphs Gong, Helin
 2017
 31-40 C p. 154-160
7 p.
 artikel
4370 The number of steps and the final configuration of relaxation procedures on graphs Chen, Sheng-Hua
 2015
 31-40 C p. 50-53
4 p.
 artikel
4371 The number of subtrees in graphs with given number of cut edges Xu, Kexiang
31-40 C p. 283-296
 artikel
4372 The number of switching isomorphism classes of signed graphs associated with particular graphs Bagheri, Y.
31-40 C p. 25-33
 artikel
4373 The numbers of repeated palindromes in the Fibonacci and Tribonacci words Huang, Yuke
 2017
 31-40 C p. 78-90
13 p.
 artikel
4374 The one-station bike repositioning problem Angelelli, E.
31-40 C p. 173-196
 artikel
4375 The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs Lu, Hui-Chuan
 2017
 31-40 C p. 131-142
12 p.
 artikel
4376 The optimal rubbling number of ladders, prisms and Möbius-ladders Katona, Gyula Y.
 2016
 31-40 C p. 227-246
20 p.
 artikel
4377 The optimal way to play the most difficult repeated two-player coordination games Kuusisto, Antti
31-40 C p. 36-52
 artikel
4378 The order-preserving pattern matching problem in practice Cantone, Domenico
31-40 C p. 11-25
 artikel
4379 The oriented chromatic number of the hexagonal grid is 6 Lozano, Antoni
31-40 C p. 122-128
 artikel
4380 The outerplanar crossing number of the complete bipartite graph Ábrego, Bernardo M.
31-40 C p. 379-384
 artikel
4381 The Overfull Conjecture on split-comparability and split-interval graphs da Soledade Gonzaga, Luis Gustavo
31-40 C p. 228-238
 artikel
4382 The packing chromatic number of hypercubes Torres, Pablo
 2015
 31-40 C p. 127-140
14 p.
 artikel
4383 The packing chromatic number of the infinite square lattice is between 13 and 15 Martin, Barnaby
 2017
 31-40 C p. 136-142
7 p.
 artikel
4384 The packing coloring of distance graphs D ( k , t ) Ekstein, Jan
 2014
 31-40 C p. 100-106
7 p.
 artikel
4385 The packing number of the double vertex graph of the path graph Gómez Soto, J.M.
31-40 C p. 327-340
 artikel
4386 The palindromization map Perrin, Dominique
31-40 C p. 202-214
 artikel
4387 The partial order competition dimensions of bipartite graphs Choi, Jihoon
 2019
 31-40 C p. 47-55
 artikel
4388 The 3-path-connectivity of the hypercubes Zhu, Wen-Han
31-40 C p. 203-209
 artikel
4389 The 3-path-connectivity of the star graphs Li, Lin
31-40 C p. 215-235
 artikel
4390 The Pfaffian property of Cayley graphs on dihedral groups Lu, Fuliang
31-40 C p. 642-649
 artikel
4391 The Pfaffian property of circulant graphs Lu, Fuliang
 2015
 31-40 C p. 185-192
8 p.
 artikel
4392 The phylogeny number of a graph in the aspect of its triangles and diamonds Eoh, Soogang
31-40 C p. 304-314
 artikel
4393 The planar Ramsey number P R ( C 4 , K 8 ) Chen, Yaojun
 2014
 31-40 C p. 28-34
7 p.
 artikel
4394 The planar Turán number of double stars S 2 , l Xu, Xin
31-40 C p. 131-136
 artikel
4395 The polynomial reconstruction problem for graphs having cut-vertices of degree two Farrugia, Alexander
31-40 C p. 165-175
 artikel
4396 The power graph of a torsion-free group determines the directed power graph Zahirović, Samir
31-40 C p. 109-118
 artikel
4397 The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings Cazaux, Bastien
 2016
 31-40 C p. 48-60
13 p.
 artikel
4398 The power of small coalitions under two-tier majority on regular graphs Chebotarev, Pavel
31-40 C p. 239-258
 artikel
4399 The precedence constrained knapsack problem: Separating maximally violated inequalities Espinoza, Daniel
 2015
 31-40 C p. 65-80
16 p.
 artikel
4400 The preclusion numbers and edge preclusion numbers in a class of Cayley graphs Zhang, Guozhen
31-40 C p. 465-471
 artikel
4401 The price of connectivity for dominating set: Upper bounds and complexity Camby, Eglantine
 2014
 31-40 C p. 53-59
7 p.
 artikel
4402 The probabilistic approach to limited packings in graphs Gagarin, Andrei
 2015
 31-40 C p. 146-153
8 p.
 artikel
4403 The probabilistic minimum dominating set problem Boria, Nicolas
 2018
 31-40 C p. 93-113
 artikel
4404 The proper conflict-free k -coloring problem and the odd k -coloring problem are NP-complete on bipartite graphs Ahn, Jungho
31-40 C p. 10-17
 artikel
4405 The proper 2-connection number and size of graphs Doan, Trung Duy
31-40 C p. 296-303
 artikel
4406 The proper 2-connection number of several graph classes Brause, Christoph
31-40 C p. 34-44
 artikel
4407 The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks Hung, Ruo-Wei
 2015
 31-40 C p. 109-122
14 p.
 artikel
4408 The proportional partitional Shapley value Alonso-Meijide, José María
 2015
 31-40 C p. 1-11
11 p.
 artikel
4409 The pseudograph ( r , s , a , t ) -threshold number Hilton, Anthony J.W.
 2016
 31-40 C p. 153-163
11 p.
 artikel
4410 The 5-puzzle doubly covers the soccer ball Hanaoka, Erika
31-40 C p. 164-168
 artikel
4411 The q -analogue of zero forcing for certain families of graphs Fallat, Shaun
31-40 C p. 91-104
 artikel
4412 The quadratic M-convexity testing problem Iwamasa, Yuni
 2018
 31-40 C p. 106-114
 artikel
4413 The query complexity of a permutation-based variant of Mastermind Afshani, Peyman
 2019
 31-40 C p. 28-50
 artikel
4414 The radius and center of Fibonacci-run graphs Wei, Jianxin
31-40 C p. 93-96
 artikel
4415 The rainbow numbers of cycles in maximal bipartite planar graph Ren, Lei
31-40 C p. 37-43
 artikel
4416 The rank of a complex unit gain graph in terms of the rank and the independence number of its underlying graph Wu, Qi
31-40 C p. 66-78
 artikel
4417 The read once formula of a series–parallel network Mundici, Daniele
31-40 C p. 304-310
 artikel
4418 There is no perfect Mondrian partition for squares of side lengths less than 1001 García-Colín, Natalia
31-40 C p. 400-406
 artikel
4419 The reliability analysis based on the generalized connectivity in balanced hypercubes Wei, Chao
31-40 C p. 19-32
 artikel
4420 The resistance distance of a dual number weighted graph Li, Yu
31-40 C p. 154-165
 artikel
4421 The resistance perturbation distance: A metric for the analysis of dynamic networks Monnig, Nathan D.
 2018
 31-40 C p. 347-386
 artikel
4422 The restricted h -connectivity of the data center network DCell Wang, Xi
 2016
 31-40 C p. 144-157
14 p.
 artikel
4423 The r -hued coloring of K 4 ( 7 ) -minor free graphs Zou, Jiani
31-40 C p. 427-436
 artikel
4424 The robot crawler graph process Bonato, Anthony
31-40 C p. 23-36
 artikel
4425 The Roman { 2 } -domatic number of graphs Volkmann, Lutz
 2019
 31-40 C p. 235-241
 artikel
4426 The r -switching-stable graphs McLeod, Jeanette C.
 2019
 31-40 C p. 16-29
 artikel
4427 The sandpile group of a polygon flower Chen, Haiyan
 2019
 31-40 C p. 68-82
 artikel
4428 The Schrijver system of the flow cone in series–parallel graphs Barbato, Michele
31-40 C p. 162-167
 artikel
4429 The second largest eigenvalue and vertex-connectivity of regular multigraphs O, Suil
31-40 C p. 118-124
 artikel
4430 The second Zagreb indices of graphs with given degree sequences Yuan, Wei-Gang
 2015
 31-40 C p. 230-238
9 p.
 artikel
4431 The second Zagreb indices of unicyclic graphs with given degree sequences Liu, Muhuo
 2014
 31-40 C p. 217-221
5 p.
 artikel
4432 The secure domination number of Cartesian products of small graphs with paths and cycles Haythorpe, Michael
31-40 C p. 32-45
 artikel
4433 The security of all private-key bits in isogeny-based schemes Shani, Barak
31-40 C p. 184-195
 artikel
4434 The set chromatic number of random graphs Dudek, Andrzej
 2016
 31-40 C p. 61-70
10 p.
 artikel
4435 The shape of node reliability Brown, Jason I.
 2018
 31-40 C p. 41-55
 artikel
4436 The shortest connection game Darmann, Andreas
 2017
 31-40 C p. 139-154
16 p.
 artikel
4437 The signed Roman k -domatic number of a graph Volkmann, Lutz
 2015
 31-40 C p. 150-157
8 p.
 artikel
4438 The signless Laplacian and distance signless Laplacian spectral radius of digraphs with some given parameters Xi, Weige
 2017
 31-40 C p. 136-141
 artikel
4439 The simultaneous metric dimension of graph families Ramírez-Cruz, Yunior
 2016
 31-40 C p. 241-250
10 p.
 artikel
4440 The size and the spectral radius of a saturated non-covered graph Wu, Zeyuan
31-40 C p. 343-349
 artikel
4441 The size of graphs with given feedback vertex number Wang, Tao
31-40 C p. 213-222
 artikel
4442 The S -labeling problem: An algorithmic tour Fertin, Guillaume
 2018
 31-40 C p. 49-61
 artikel
4443 The smallest nontrivial snarks of oddness 4 Goedgebeur, Jan
31-40 C p. 139-162
 artikel
4444 The smallest pair of cospectral cubic graphs with different chromatic indexes Yan, Zhidan
31-40 C p. 265-268
 artikel
4445 The Solitaire Clobber game and correducibility of graphs Dantas, Simone
31-40 C p. 144-150
 artikel
4446 The Solitaire Clobber game and the correducibility of k -connected graphs Fujimori, Tatsuya
31-40 C p. 16-22
 artikel
4447 The spanning cyclability of Cayley graphs generated by transposition trees Qiao, Hongwei
31-40 C p. 60-69
 artikel
4448 The spanning tree congestion problem on interval graphs Lin, Lan
31-40 C p. 147-153
 artikel
4449 The spectral radius of 3-graphs without Berge paths of given length Fang, Lusheng
31-40 C p. 414-428
 artikel
4450 The ɛ -spectral radius of trees with perfect matchings Huang, Lu
31-40 C p. 110-130
 artikel
4451 The spectrum and toughness of regular graphs Cioabă, Sebastian M.
31-40 C p. 43-52
 artikel
4452 The speed and threshold of the biased perfect matching and Hamilton cycle games Brüstle, Noah
31-40 C p. 23-40
 artikel
4453 The splitting power of branching programs of bounded repetition and CNFs of bounded width Razgon, Igor
31-40 C p. 366-381
 artikel
4454 The square density of words having a sequence of FS-double squares Patawar, Maithilee
31-40 C p. 349-358
 artikel
4455 The stable b -matching polytope revisited Eirinakis, Pavlos
 2018
 31-40 C p. 186-201
 artikel
4456 The statistical analysis for Sombor indices in a random polygonal chain networks Liu, Jia-Bao
31-40 C p. 218-233
 artikel
4457 The Steiner k -Wiener index of graphs with given minimum degree Dankelmann, Peter
 2019
 31-40 C p. 35-43
 artikel
4458 The Steiner tree in K 1 , r -free split graphs—A Dichotomy Renjith, P.
31-40 C p. 246-255
 artikel
4459 The ( 1 , 2 ) -step competition graph of a pure local tournament that is not round decomposable Zhang, Xinhong
 2016
 31-40 C p. 180-190
11 p.
 artikel
4460 The Stochastic Boolean Function Evaluation problem for symmetric Boolean functions Gkenosis, Dimitrios
31-40 C p. 269-277
 artikel
4461 The strongly regular twisted D 5 , 5 ( q ) graph Ihringer, Ferdinand
31-40 C p. 190-194
 artikel
4462 The strong metric dimension of the power graph of a finite group Ma, Xuanlong
 2018
 31-40 C p. 159-164
 artikel
4463 The structure of 2-colored best match graphs Korchmaros, Annachiara
31-40 C p. 397-416
 artikel
4464 The structure of minimally t -tough, 2 K 2 -free graphs Ma, Hui
31-40 C p. 1-9
 artikel
4465 The sum necessary to ensure that a degree sequence pair has an A -connected realization Guan, Jing-Xin
31-40 C p. 97-107
 artikel
4466 The symmetry-moderated Wiener index of truncation graph, Thorn graph and Caterpillars Iranmanesh, Mohammad A.
 2019
 31-40 C p. 41-51
 artikel
4467 The symmetry rule in propositional logic Urquhart, Alasdair
 1999
 31-40 C p. 177-193
17 p.
 artikel
4468 The target location function on finite trees Leach, Trevor
31-40 C p. 316-321
 artikel
4469 The terminal-pairability problem in complete bipartite graphs Lv, Zequn
31-40 C p. 64-67
 artikel
4470 The Territorial Raider game and graph derangements Galanter, Nina
 2016
 31-40 C p. 13-16
4 p.
 artikel
4471 The thickness of a graph with constraint on girth Ma, Dengju
31-40 C p. 374-383
 artikel
4472 The threshold dimension of a graph Mol, Lucas
31-40 C p. 118-133
 artikel
4473 The time complexity of oriented chromatic number for acyclic oriented connected subcubic subgraphs of grids Coelho, E.M.M.
31-40 C p. 96-109
 artikel
4474 The total interval number of a graph, III: Tree-like graphs Kratzke, Thomas M.
31-40 C p. 163-189
 artikel
4475 The train frequency compatibility problem Cerdeira, Jorge Orestes
 2019
 31-40 C p. 18-26
 artikel
4476 The ( t , r ) broadcast domination number of some regular graphs Herrman, Rebekah
31-40 C p. 270-280
 artikel
4477 The trees with the second smallest normalized Laplacian eigenvalue at least 1 − 3 2 Tian, Xiaoguo
 2017
 31-40 C p. 118-133
16 p.
 artikel
4478 The tree-width of C Krause, Philipp Klaus
31-40 C p. 136-152
 artikel
4479 The Turán number for spanning linear forests Wang, Jian
 2019
 31-40 C p. 291-294
 artikel
4480 The Turán number of the square of a path Xiao, Chuanqi
31-40 C p. 1-14
 artikel
4481 The Turán number of the triangular pyramid of 3-layers Ghosh, Debarun
31-40 C p. 75-85
 artikel
4482 The unassigned distance geometry problem Duxbury, P.M.
 2016
 31-40 C p. 117-132
16 p.
 artikel
4483 The underlying graph of a line digraph Villar, J.L
 1992
 31-40 C p. 525-538
14 p.
 artikel
4484 The undirected optical indices of complete m -ary trees Lo, Yuan-Hsun
31-40 C p. 173-181
 artikel
4485 The unit acquisition number of a graph Johnson, Frederick
 2019
 31-40 C p. 166-176
 artikel
4486 The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths Kamiyama, Naoyuki
 2014
 31-40 C p. 89-100
12 p.
 artikel
4487 The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes Ducoffe, Guillaume
31-40 C p. 201-222
 artikel
4488 The VC-dimension of graphs with respect to k -connected subgraphs Munaro, Andrea
 2016
 31-40 C p. 163-174
12 p.
 artikel
4489 The vertex leafage of chordal graphs Chaplick, Steven
 2014
 31-40 C p. 14-25
12 p.
 artikel
4490 The vertex Turán density in 3-ary n -cubes Li, Xiao-Chen
31-40 C p. 129-141
 artikel
4491 The von Neumann entropy of random multipartite graphs Hu, Dan
 2017
 31-40 C p. 201-206
 artikel
4492 The weak robustness of interval matrices in max –plus algebra Plavka, Ján
 2014
 31-40 C p. 92-101
10 p.
 artikel
4493 The weight balance function on trees McMorris, F.R.
31-40 C p. 66-73
 artikel
4494 The weighted coloring problem for two graph classes characterized by small forbidden induced structures Malyshev, D.S.
31-40 C p. 423-432
 artikel
4495 The weighted Mostar index of cacti Liu, Mengmeng
31-40 C p. 19-33
 artikel
4496 The weighted total cophenetic index: A novel balance index for phylogenetic networks Knüver, Linda
31-40 C p. 89-142
 artikel
4497 The weighted vertex PI index of bicyclic graphs Ma, Gang
31-40 C p. 309-321
 artikel
4498 The weighted vertex PI index of tricyclic graphs Ma, Gang
31-40 C p. 89-96
 artikel
4499 The wide-diameter of Z n , k Qi, Hao
 2017
 31-40 C p. 193-201
9 p.
 artikel
4500 The Wiener index of the zero-divisor graph of a finite commutative ring with unity Selvakumar, K.
31-40 C p. 72-84
 artikel
4501 The Wiener index of the zero-divisor graph of Z n Asir, T.
31-40 C p. 461-471
 artikel
4502 The worst case number of questions in Generalized AB game with and without white-peg answers Jäger, Gerold
 2015
 31-40 C p. 20-31
12 p.
 artikel
4503 The zero forcing number of claw-free cubic graphs He, Mengya
31-40 C p. 321-330
 artikel
4504 The zero forcing polynomial of a graph Boyer, Kirk
 2019
 31-40 C p. 35-48
 artikel
4505 Thin edges in the subgraph induced by noncubic vertices of a brace He, Xiaoling
31-40 C p. 153-156
 artikel
4506 Thinness of product graphs Bonomo-Braberman, Flavia
31-40 C p. 52-71
 artikel
4507 Thrackles: An improved upper bound Fulek, Radoslav
 2019
 31-40 C p. 226-231
 artikel
4508 Three-arc graphs: Characterization and domination Xu, Guangjun
 2015
 31-40 C p. 200-207
8 p.
 artikel
4509 Three results towards approximation of special maximum matchings in graphs Mkrtchyan, Vahan
31-40 C p. 127-136
 artikel
4510 Threshold group testing with consecutive positives Chang, Huilan
 2014
 31-40 C p. 68-72
5 p.
 artikel
4511 Throttling positive semidefinite zero forcing propagation time on graphs Carlson, Joshua
 2019
 31-40 C p. 33-46
 artikel
4512 Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs Doron-Arad, Ilan
31-40 C p. 453-464
 artikel
4513 Tight bounds on odd chromatic number of some standard graph products Priyamvada,
31-40 C p. 1-13
 artikel
4514 Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs Furmańczyk, Hanna
 2018
 31-40 C p. 116-122
 artikel
4515 Tight conditions for spanning trees with leaf degree at most k in graphs Lin, Jifu
31-40 C p. 97-104
 artikel
4516 Tight isolated toughness bound for fractional ( k , n ) -critical graphs Gao, Wei
31-40 C p. 194-202
 artikel
4517 Tight lower bounds on broadcast function for n = 24 and 25 Barsky, Georgy
 2014
 31-40 C p. 109-114
6 p.
 artikel
4518 Tightly coupled multi-group threshold secret sharing based on Chinese Remainder Theorem Meng, Keju
 2019
 31-40 C p. 152-163
 artikel
4519 Tight-optimal circulants vis-à-vis twisted tori Jha, Pranava K.
 2014
 31-40 C p. 24-34
11 p.
 artikel
4520 Tight upper bound of the rainbow vertex-connection number for 2-connected graphs Li, Xueliang
 2014
 31-40 C p. 62-69
8 p.
 artikel
4521 Tilted inequalities and facets of the set covering polytope: A theoretical analysis Lamothe, François
31-40 C p. 143-160
 artikel
4522 Timber game as a counting problem Furtado, Ana
 2019
 31-40 C p. 193-202
 artikel
4523 Time-delayed Cops and Robbers Clarke, Nancy E.
31-40 C p. 394-405
 artikel
4524 Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm Arigliano, Anna
 2019
 31-40 C p. 28-39
 artikel
4525 2-tone coloring of cactus graphs Bickle, Allan
31-40 C p. 175-186
 artikel
4526 Tool switching problems with tool order constraints Iori, Manuel
31-40 C p. 249-262
 artikel
4527 Topological properties on the diameters of the integer simplex Ma, Meijie
 2015
 31-40 C p. 291-294
4 p.
 artikel
4528 Top to random shuffles on colored permutations Nakano, Fumihiko
31-40 C p. 336-348
 artikel
4529 Torus-like graphs and their paired many-to-many disjoint path covers Park, Jung-Heum
31-40 C p. 64-77
 artikel
4530 Total colorings of complete multipartite graphs using amalgamations Dalal, Aseem
31-40 C p. 186-195
 artikel
4531 Total colorings of planar graphs without chordal 6-cycles Wang, Bing
 2014
 31-40 C p. 116-121
6 p.
 artikel
4532 Total domination cover rubbling Beeler, Robert A.
31-40 C p. 133-141
 artikel
4533 Total 2-domination of proper interval graphs Soulignac, Francisco J.
31-40 C p. 256-262
 artikel
4534 Total domination stability in graphs Henning, Michael A.
 2018
 31-40 C p. 246-255
 artikel
4535 Total domishold graphs: A generalization of threshold graphs, with connections to threshold hypergraphs Chiarelli, Nina
 2014
 31-40 C p. 1-12
12 p.
 artikel
4536 Total k -domination in Cartesian product of complete graphs Carballosa, Walter
31-40 C p. 25-41
 artikel
4537 Total k -domination in strong product graphs Bermudo, S.
 2019
 31-40 C p. 51-58
 artikel
4538 ( 2 , 1 ) -total labeling of trees with large maximum degree Chen, Dong
 2015
 31-40 C p. 61-69
9 p.
 artikel
4539 Totally optimal decision rules Amin, Talha
 2018
 31-40 C p. 453-458
 artikel
4540 Totally optimal decision trees for Boolean functions Chikalov, Igor
 2016
 31-40 C p. 1-13
13 p.
 artikel
4541 Total-rainbow connection and forbidden subgraphs Zhang, Jingshu
31-40 C p. 364-370
 artikel
4542 Total rainbow connection of digraphs Lei, Hui
 2018
 31-40 C p. 288-305
 artikel
4543 Total rainbow k -connection in graphs Liu, Henry
 2014
 31-40 C p. 92-101
10 p.
 artikel
4544 Total Roman domination in the lexicographic product of graphs Campanelli, Nicolás
 2019
 31-40 C p. 88-95
 artikel
4545 Total tessellation cover: Bounds, hardness, and applications Abreu, Alexandre
31-40 C p. 149-161
 artikel
4546 (Total) Vector domination for graphs with bounded branchwidth Ishii, Toshimasa
 2016
 31-40 C p. 80-89
10 p.
 artikel
4547 Toughness and binding number Bauer, D.
 2014
 31-40 C p. 60-68
9 p.
 artikel
4548 Toughness and distance spectral radius in graphs involving minimum degree Lou, Jing
31-40 C p. 34-47
 artikel
4549 Toughness and prism-hamiltonicity of P 4 -free graphs Ellingham, M.N.
31-40 C p. 201-206
 artikel
4550 Tower of covering arrays Torres-Jimenez, Jose
 2015
 31-40 C p. 141-146
6 p.
 artikel
4551 Tracking Paths Banik, Aritra
31-40 C p. 22-34
 artikel
4552 Tractability, hardness, and kernelization lower bound for and/or graph solution dos Santos Souza, Uéverton
 2017
 31-40 C p. 125-133
 artikel
4553 Trade-offs among degree, diameter, and number of paths Ishii, Toshimasa
31-40 C p. 96-100
 artikel
4554 Transferable domination number of graphs Chang, Fei-Huang
31-40 C p. 135-146
 artikel
4555 Transit functions and pyramid-like binary clustering systems Changat, Manoj
31-40 C p. 365-384
 artikel
4556 Transitive systems and conclusive partial orders Cigler, Grega
31-40 C p. 129-141
 artikel
4557 Transmitting in the n-dimensional cube Alon, Noga
 1992
 31-40 C p. 9-11
3 p.
 artikel
4558 Transverse rigidity is prestress stability Gortler, Steven J.
31-40 C p. 439-441
 artikel
4559 Travelling salesman paths on Demidenko matrices Çela, Eranda
31-40 C p. 3-14
 artikel
4560 Treelength of series–parallel graphs Dissaux, Thomas
31-40 C p. 16-30
 artikel
4561 Tree spanners of bounded degree graphs Papoutsakis, Ioannis
 2018
 31-40 C p. 395-407
 artikel
4562 Trees with equal total domination and game total domination numbers Henning, Michael A.
 2017
 31-40 C p. 58-70
13 p.
 artikel
4563 Trees with large m -eternal domination number Henning, Michael A.
 2016
 31-40 C p. 79-85
7 p.
 artikel
4564 Trees with large neighborhood total domination number Henning, Michael A.
 2015
 31-40 C p. 96-102
7 p.
 artikel
4565 Trees with maximum exponential Randić index Cruz, Roberto
31-40 C p. 634-643
 artikel
4566 Trees with maximum p -reinforcement number Lu, You
 2014
 31-40 C p. 43-54
12 p.
 artikel
4567 Tree t -spanners in outerplanar graphs via supply demand partition Narayanaswamy, N.S.
 2015
 31-40 C p. 104-109
6 p.
 artikel
4568 Treewidth and gonality of glued grid graphs Aidun, Ivan
31-40 C p. 1-11
 artikel
4569 Treewidth of the q -Kneser graphs Cao, Mengyu
31-40 C p. 174-180
 artikel
4570 Tree with maximum non-self-centrality number among all trees of fixed order and maximum degree Farooq, Rashid
31-40 C p. 26-34
 artikel
4571 Triangle-free 2-matchings and M-concave functions on jump systems Kobayashi, Yusuke
 2014
 31-40 C p. 35-42
8 p.
 artikel
4572 Triangle-free projective-planar graphs with diameter two: Domination and characterization Chakraborty, Dibyayan
31-40 C p. 11-24
 artikel
4573 Triangle-free signed graphs with small negative inertia index Duan, Fang
31-40 C p. 135-142
 artikel
4574 Triangulations and equality in the domination chain Finbow, Stephen
 2015
 31-40 C p. 81-92
12 p.
 artikel
4575 Trichotomy for integer linear systems based on their sign patterns Kimura, Kei
 2016
 31-40 C p. 67-78
12 p.
 artikel
4576 Tricyclic graphs with maximal revised Szeged index Chen, Lily
 2014
 31-40 C p. 71-79
9 p.
 artikel
4577 Tricyclic graph with maximal Estrada index Zhu, Zhongxun
 2014
 31-40 C p. 364-372
9 p.
 artikel
4578 Tridiagonal maximum-entropy sampling and tridiagonal masks Al-Thani, Hessa
31-40 C p. 120-138
 artikel
4579 Tropical Kirchhoff’s formula and postoptimality in matroid optimization Jukna, Stasys
31-40 C p. 12-21
 artikel
4580 Truncated metric dimension for finite graphs Frongillo, Rafael M.
31-40 C p. 150-169
 artikel
4581 Turán number of 3-free strong digraphs with out-degree restriction Chen, Bin
31-40 C p. 252-264
 artikel
4582 Turán numbers and batch codes Bujtás, Csilla
 2015
 31-40 C p. 45-55
11 p.
 artikel
4583 Turán problem of signed graph for negative odd cycle Wang, Junjie
31-40 C p. 157-166
 artikel
4584 Tutte’s dichromate for signed graphs Goodall, Andrew
31-40 C p. 153-184
 artikel
4585 Twin-width of graphs with tree-structured decompositions Heinrich, Irene
31-40 C p. 1-15
 artikel
4586 Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost He, Cheng
31-40 C p. 94-101
 artikel
4587 Two classes of optimal p -ary few-weight codes from down-sets Shi, Minjia
31-40 C p. 60-67
 artikel
4588 Two classes of 1-resilient semi-bent functions based on disjoint linear codes Li, Luyang
31-40 C p. 147-157
 artikel
4589 Two completely independent spanning trees of split graphs Chen, Xiaodong
31-40 C p. 76-78
 artikel
4590 Two complexity results for the vertex coloring problem Malyshev, D.S.
 2017
 31-40 C p. 158-166
9 p.
 artikel
4591 Two degree-distance based topological descriptors of some product graphs Malik, Mehar Ali
 2018
 31-40 C p. 315-328
 artikel
4592 Two dependent probabilistic chip-collecting games Harrington, Joshua
31-40 C p. 74-86
 artikel
4593 Two-dimensional closest pair problem: A closer look Daescu, Ovidiu
31-40 C p. 85-96
 artikel
4594 Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs Zhang, Hui
31-40 C p. 320-328
 artikel
4595 Two-disjoint-cycle-cover edge/vertex bipancyclicity of star graphs Xue, Shudan
31-40 C p. 196-208
 artikel
4596 Two-disjoint-cycle-cover pancyclicity of augmented cubes Cheng, Dongqin
31-40 C p. 240-246
 artikel
4597 Two-graphs and NSSDs: An algebraic approach Sciriha, Irene
 2019
 31-40 C p. 92-102
 artikel
4598 Two infinite families of critical clique–Helly graphs Alcón, Liliana
31-40 C p. 2-5
 artikel
4599 Two kinds of generalized connectivity of dual cubes Zhao, Shu-Li
 2019
 31-40 C p. 306-316
 artikel
4600 Two-machine job-shop scheduling with one joint job Numaguchi, Hiroki
31-40 C p. 30-43
 artikel
4601 Two more characterizations of König–Egerváry graphs Jarden, Adi
 2017
 31-40 C p. 175-180
6 p.
 artikel
4602 Two new approximation schemes for maximizing the weighted number of just-in-time jobs in a multi-machine proportionate flow shop Gawiejnowicz, Stanisław
31-40 C p. 429-435
 artikel
4603 Two problems on Laplacian ratios of trees Wu, Tingzeng
31-40 C p. 224-236
 artikel
4604 Two results about the hypercube Balogh, József
31-40 C p. 322-326
 artikel
4605 Two-to-one functions from Galois extensions Bartoli, Daniele
31-40 C p. 194-201
 artikel
4606 Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates Gao, Yuan
 2015
 31-40 C p. 49-52
4 p.
 artikel
4607 Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines Chen, Rubing
31-40 C p. 45-54
 artikel
4608 Unary NP-hardness of transportation and batching scheduling to minimize the total weighted completion time Wei, Hongjun
31-40 C p. 45-52
 artikel
4609 Unavoidable patterns in 2-colorings of the complete bipartite graph Hansberg, Adriana
31-40 C p. 50-60
 artikel
4610 Unicyclic and bicyclic graphs with maximum exponential second Zagreb index Eliasi, Mehdi
31-40 C p. 172-179
 artikel
4611 Unicyclic graphs with extremal values of arithmetic–geometric index Vukićević, Žana Kovijanić
31-40 C p. 67-75
 artikel
4612 Unicyclic signed graphs with minimal energy Bhat, Mushtaq A.
 2017
 31-40 C p. 32-39
8 p.
 artikel
4613 Unicyclic signed graphs with the first ⌊ n + 1 2 ⌋ largest energies Zhu, Jianming
31-40 C p. 350-363
 artikel
4614 Unified extremal results for k -apex unicyclic graphs (trees) Liu, Muhuo
31-40 C p. 35-49
 artikel
4615 Unified extremal results of topological indices and spectral invariants of graphs Yao, Yuedan
 2019
 31-40 C p. 218-232
 artikel
4616 Uniform and monotone line sum optimization Koutecký, Martin
31-40 C p. 165-170
 artikel
4617 Uniform clutters and dominating sets of graphs Martí-Farré, Jaume
 2019
 31-40 C p. 220-233
 artikel
4618 Uniform forcing and immune sets in graphs and hypergraphs Fàbrega, Josep
31-40 C p. 23-33
 artikel
4619 Union–intersection-bounded families and their applications Gu, Yujie
 2019
 31-40 C p. 346-354
 artikel
4620 Unions of digraphs which become kernel perfect Galeana-Sánchez, Hortensia
 2019
 31-40 C p. 160-165
 artikel
4621 Uniquely forced perfect matching and unique 3-edge-coloring Wu, Yezhou
 2016
 31-40 C p. 203-207
5 p.
 artikel
4622 Uniquely identifying the edges of a graph: The edge metric dimension Kelenc, Aleksander
 2018
 31-40 C p. 204-220
 artikel
4623 Uniquely restricted matchings in subcubic graphs Fürst, Maximilian
 2019
 31-40 C p. 189-194
 artikel
4624 Unique-maximum edge-colouring of plane graphs with respect to faces Fabrici, Igor
 2015
 31-40 C p. 239-243
5 p.
 artikel
4625 Uniqueness and reconstruction of finite lattice sets from their line sums Ascolese, Michela
31-40 C p. 293-306
 artikel
4626 Unitary Cayley graphs of finite semisimple rings Tangsakul, Thanatach
31-40 C p. 87-94
 artikel
4627 Unit dual quaternion directed graphs, formation control and general weighted directed graphs Qi, Liqun
31-40 C p. 197-209
 artikel
4628 Unit form recognition by mutations: Application of mutations in the search of positive roots Alves, Jesmmer
31-40 C p. 223-236
 artikel
4629 Universality for polynomial invariants for ribbon graphs with half-ribbons Avohou, Rémi C.
31-40 C p. 1-17
 artikel
4630 Universal solvability of interval max-plus matrix equations Myšková, Helena
 2018
 31-40 C p. 165-173
 artikel
4631 Unlabeled compression schemes exceeding the VC-dimension Pálvölgyi, Dömötör
31-40 C p. 102-107
 artikel
4632 Unraveling the enigmatic irregular coloring of Honeycomb Networks S., Shyama
31-40 C p. 282-296
 artikel
4633 Unreliable point facility location problems on networks Puerto, Justo
 2014
 31-40 C p. 188-203
16 p.
 artikel
4634 Unrooted non-binary tree-based phylogenetic networks Fischer, Mareike
31-40 C p. 10-30
 artikel
4635 Upper and lower bounds for competitive group testing Scheidweiler, Robert
31-40 C p. 136-150
 artikel
4636 Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier Goeke, Dominik
 2019
 31-40 C p. 43-61
 artikel
4637 Upper bound for DP-chromatic number of a graph Lv, Jian-Bo
31-40 C p. 28-32
 artikel
4638 Upper bounds and approximation results for the k -slow burning problem Hiller, Michaela
31-40 C p. 88-104
 artikel
4639 Upper bounds for bar visibility of subgraphs and n -vertex graphs Feng, Yuanrui
31-40 C p. 272-274
 artikel
4640 Upper bounds for some graph invariants in terms of blocks and cut-vertices Zaker, Manouchehr
31-40 C p. 50-60
 artikel
4641 Upper bounds for stabbing simplices by a line Daum-Sadon, Inbar
31-40 C p. 248-259
 artikel
4642 Upper bounds for the inverse sum indeg index of graphs Matejić, M.M.
 2018
 31-40 C p. 258-267
 artikel
4643 Upper bounds for the M D -numbers and characterization of extremal graphs Li, Ping
31-40 C p. 1-12
 artikel
4644 Upper bounds of r -hued colorings of planar graphs Song, Huimin
 2018
 31-40 C p. 262-269
 artikel
4645 Upper bounds on adjacent vertex distinguishing total chromatic number of graphs Hu, Xiaolan
 2017
 31-40 C p. 29-32
4 p.
 artikel
4646 Upper bounds on the average eccentricity Dankelmann, Peter
 2014
 31-40 C p. 72-79
8 p.
 artikel
4647 Upper bounds on the average eccentricity of K 3 -free and C 4 -free graphs Dankelmann, P.
 2019
 31-40 C p. 106-114
 artikel
4648 Upper bounds on the balanced 〈 r , s 〉 -domination number of a graph Roux, A.
 2014
 31-40 C p. 214-221
8 p.
 artikel
4649 Upper bounds on the Boolean rank of Kronecker products Haviv, Ishay
31-40 C p. 82-96
 artikel
4650 Upper bounds on the global offensive alliances in graphs Rad, Nader Jafari
31-40 C p. 148-152
 artikel
4651 Upper bounds on the k -forcing number of a graph Amos, David
 2015
 31-40 C p. 1-10
10 p.
 artikel
4652 Upper bounds on the locating chromatic number of trees Furuya, Michitaka
 2019
 31-40 C p. 338-341
 artikel
4653 Use of simple arithmetic operations to construct efficiently implementable Boolean functions possessing high nonlinearity and good resistance to algebraic attacks Carlet, Claude
31-40 C p. 256-270
 artikel
4654 Using congruence relations to extract knowledge from concept lattices Viaud, Jean-François
 2018
 31-40 C p. 135-150
 artikel
4655 Using dual feasible functions to construct fast lower bounds for routing and location problems Porumbel, Daniel
 2015
 31-40 C p. 83-99
17 p.
 artikel
4656 Using exploratory analyses to select judges and create the components of a naming test to study aphasia Camiz, Sergio
 2015
 31-40 C p. 114-122
9 p.
 artikel
4657 Using semidirect products of groups to build classes of interconnection networks Stewart, Iain A.
31-40 C p. 78-97
 artikel
4658 Using SPQR-trees to speed up recognition algorithms based on 2-cutsets de Macedo Filho, H.B.
 2018
 31-40 C p. 101-108
 artikel
4659 Values for cooperative games with a prior unions and a communication graph based on combined effects Zou, Rong
31-40 C p. 231-245
 artikel
4660 Values for games with two-level communication structures Khmelnitskaya, Anna
 2014
 31-40 C p. 34-50
17 p.
 artikel
4661 Values for level structures with polynomial-time algorithms, relevant coalition functions, and general considerations Besner, Manfred
31-40 C p. 85-109
 artikel
4662 Vapnik–Chervonenkis dimension and density on Johnson and Hamming graphs Adler, Isolde
31-40 C p. 29-44
 artikel
4663 γ -variable first-order logic of preferential attachment random graphs Malyshkin, Y.A.
31-40 C p. 223-227
 artikel
4664 Variants of ( s , t ) -Wythoff’s game Li, Haiyan
 2017
 31-40 C p. 1-12
 artikel
4665 Variants of the Erdős distinct sums problem and variance method Costa, Simone
31-40 C p. 110-123
 artikel
4666 Variations of cops and robbers game on grids Das, Sandip
31-40 C p. 340-349
 artikel
4667 Variations of largest rectangle recognition amidst a bichromatic point set Acharyya, Ankush
31-40 C p. 35-50
 artikel
4668 Variations on the Erdős distinct-sums problem Costa, Simone
31-40 C p. 172-185
 artikel
4669 Various characterizations of throttling numbers Carlson, Joshua
31-40 C p. 85-97
 artikel
4670 Various matching keys for asymmetric topology encryption Zhang, Xiaohui
31-40 C p. 140-153
 artikel
4671 VC-dimension and pseudo-random graphs Pham, Thang
31-40 C p. 231-246
 artikel
4672 Vectorial bent functions weakly/strongly outside the completed Maiorana–McFarland class Pasalic, E.
31-40 C p. 138-151
 artikel
4673 Vector joint majorization and generalization of Csiszár–Körner’s inequality for f -divergence Niezgoda, Marek
 2016
 31-40 C p. 195-205
11 p.
 artikel
4674 Vector partitions, multi-dimensional Faà di Bruno formulae and generating algorithms Turcu, Flavius
31-40 C p. 90-99
 artikel
4675 Vehicle scheduling under the warehouse-on-wheels policy Fliedner, Malte
 2016
 31-40 C p. 52-61
10 p.
 artikel
4676 Verification of a certificate for weakly chordal graphs Spinrad, Jeremy P.
31-40 C p. 186-192
 artikel
4677 Vertex adjacencies in the set covering polyhedron Aguilera, Néstor E.
 2017
 31-40 C p. 40-56
17 p.
 artikel
4678 Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs Cordero-Michel, Narda
31-40 C p. 281-289
 artikel
4679 Vertex and edge metric dimensions of cacti Sedlar, Jelena
31-40 C p. 126-139
 artikel
4680 Vertex and edge metric dimensions of unicyclic graphs Sedlar, Jelena
31-40 C p. 81-92
 artikel
4681 Vertex-arboricity of toroidal graphs without K 5 − and 6-cycles Zhu, Aina
31-40 C p. 97-108
 artikel
4682 Vertex-colouring of 3-chromatic circulant graphs Nicoloso, S.
 2017
 31-40 C p. 121-138
18 p.
 artikel
4683 Vertex connectivity of the power graph of a finite cyclic group Chattopadhyay, Sriparna
 2019
 31-40 C p. 259-271
 artikel
4684 Vertex-critical ( P 5 , c h a i r ) -free graphs Huang, Shenwei
31-40 C p. 9-15
 artikel
4685 Vertex-critical ( P 3 + ℓ P 1 ) -free and vertex-critical (gem, co-gem)-free graphs Abuadas, Tala
31-40 C p. 179-187
 artikel
4686 Vertex-degree based topological indices of digraphs Monsalve, Juan
31-40 C p. 13-24
 artikel
4687 Vertex-degree-based topological indices over starlike trees Betancur, Clara
 2015
 31-40 C p. 18-25
8 p.
 artikel
4688 Vertex-disjoint stars in K 1 , r -free graphs Jiang, Suyun
31-40 C p. 189-197
 artikel
4689 Vertex-distinguishing proper arc colorings of digraphs Li, Hao
 2016
 31-40 C p. 276-286
11 p.
 artikel
4690 Vertex-edge domination in unit disk graphs Jena, Sangram K.
31-40 C p. 351-361
 artikel
4691 Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes Kuo, Che-Nan
 2016
 31-40 C p. 80-85
6 p.
 artikel
4692 Vertex-minors of graphs: A survey Kim, Donggyu
31-40 C p. 54-73
 artikel
4693 Vertex-pancyclism in the generalized sum of digraphs Cordero-Michel, Narda
31-40 C p. 94-101
 artikel
4694 Vertex partitioning problems on graphs with bounded tree width Aravind, N.R.
31-40 C p. 254-270
 artikel
4695 Vertex removal in biclique graphs Montero, Leandro
31-40 C p. 302-310
 artikel
4696 Vertex types in threshold and chain graphs Anđelić, Milica
 2019
 31-40 C p. 159-168
 artikel
4697 Vertices removal for feasibility of clustered spanning trees Guttmann-Beck, Nili
31-40 C p. 68-84
 artikel
4698 VF2++—An improved subgraph isomorphism algorithm Jüttner, Alpár
 2018
 31-40 C p. 69-81
 artikel
4699 Vizing’s adjacency lemma on edge chromatic critical signed graphs and its applications Cao, Yan
31-40 C p. 96-105
 artikel
4700 Vizing’s conjecture: A two-thirds bound for claw-free graphs Krop, Elliot
 2017
 31-40 C p. 162-165
4 p.
 artikel
4701 Volume computation for sparse Boolean quadric relaxations Lee, Jon
31-40 C p. 79-94
 artikel
4702 V -Order: New combinatorial properties & a simple comparison algorithm Alatabbi, Ali
 2016
 31-40 C p. 41-46
6 p.
 artikel
4703 Voronoi polytopes for polyhedral norms on lattices Deza, Michel
 2015
 31-40 C p. 42-52
11 p.
 artikel
4704 VPG and EPG bend-numbers of Halin graphs Francis, Mathew C.
 2016
 31-40 C p. 95-105
11 p.
 artikel
4705 Vulnerability analysis of multiprocessor system based on burnt pancake networks Liu, Jiafei
31-40 C p. 304-320
 artikel
4706 Vulnerability of nearest neighbor graphs Dunkum, Molly
 2014
 31-40 C p. 42-52
11 p.
 artikel
4707 Walsh–Hadamard transforms of generalized p -ary functions and C -finite sequences Medina, Luis A.
31-40 C p. 86-96
 artikel
4708 Weak connectedness of tensor product of digraphs Chen, Sheng
 2015
 31-40 C p. 52-58
7 p.
 artikel
4709 Weak degeneracy of planar graphs without 4- and 6-cycles Wang, Tao
31-40 C p. 110-118
 artikel
4710 Weakly bipancyclic bipartite graphs Hu, Zhiquan
 2015
 31-40 C p. 102-120
19 p.
 artikel
4711 Weakly connected Roman domination in graphs Raczek, Joanna
 2019
 31-40 C p. 151-159
 artikel
4712 Weakly toll convexity in graph products Repolusk, Polona
31-40 C p. 15-22
 artikel
4713 Weak-odd chromatic index of special digraph classes Gu, Ruijuan
31-40 C p. 79-86
 artikel
4714 Weak oddness as an approximation of oddness and resistance in cubic graphs Lukot’ka, Robert
 2018
 31-40 C p. 223-226
 artikel
4715 Weak saturation number for multiple copies of the complete graph with a star removed Pu, Liqun
 2016
 31-40 C p. 216-220
5 p.
 artikel
4716 Web services composition: Complexity and models Gabrel, V.
 2015
 31-40 C p. 100-114
15 p.
 artikel
4717 Webster sequences, apportionment problems, and just-in-time sequencing Li, Xiaomin
31-40 C p. 52-69
 artikel
4718 Weight-constrained and density-constrained paths in a tree: Enumerating, counting, and k -maximum density paths Lee, Chia-Wei
 2015
 31-40 C p. 126-134
9 p.
 artikel
4719 Weighted antimagic labeling Matamala, Martín
 2018
 31-40 C p. 194-201
 artikel
4720 Weighted Coxeter graphs and generalized geometric representations of Coxeter groups Bugaenko, Vadim
 2015
 31-40 C p. 17-27
11 p.
 artikel
4721 Weighted efficient domination for some classes of H -free and of ( H 1 , H 2 ) -free graphs Brandstädt, Andreas
 2018
 31-40 C p. 130-144
 artikel
4722 Weighted efficient domination in two subclasses of P 6 -free graphs Brandstädt, Andreas
 2016
 31-40 C p. 38-46
9 p.
 artikel
4723 Weighted exchange distance of basis pairs Bérczi, Kristóf
31-40 C p. 130-143
 artikel
4724 Weighted geometric set cover with rectangles of bounded integer side lengths Madireddy, Raghunath Reddy
31-40 C p. 36-55
 artikel
4725 Weighted Harary indices of apex trees and k -apex trees Xu, Kexiang
 2015
 31-40 C p. 30-40
11 p.
 artikel
4726 Weighted independent sets in classes of P 6 -free graphs Karthick, T.
 2016
 31-40 C p. 217-226
10 p.
 artikel
4727 Weighted majority tournaments and Kemeny ranking with 2-dimensional Euclidean preferences Escoffier, Bruno
31-40 C p. 6-12
 artikel
4728 Weighted microscopic image reconstruction Bar-Noy, Amotz
31-40 C p. 17-33
 artikel
4729 Weighted Moon-type formulae for complete graphs and complete bipartite graphs Ge, Jun
31-40 C p. 274-278
 artikel
4730 Weighted total acquisition Bagan, Guillaume
31-40 C p. 260-282
 artikel
4731 Well-covered graphs without cycles of lengths 4, 5 and 6 Levit, Vadim E.
 2015
 31-40 C p. 158-167
10 p.
 artikel
4732 Well-covered triangulations: Part IV Finbow, Arthur S.
 2016
 31-40 C p. 71-94
24 p.
 artikel
4733 Well-hued graphs Goddard, Wayne
31-40 C p. 370-380
 artikel
4734 Well-indumatched Pseudoforests Büyükçolak, Yasemin
31-40 C p. 85-102
 artikel
4735 Well-quasi-ordering H -contraction-free graphs Kamiński, Marcin
 2018
 31-40 C p. 18-27
 artikel
4736 Well-solvable cases of the QAP with block-structured matrices Çela, Eranda
 2015
 31-40 C p. 56-65
10 p.
 artikel
4737 WEPA 2016 preface Mary, Arnaud
 2019
 31-40 C p. 178
 artikel
4738 What is the meaning of the graph energy after all? Estrada, Ernesto
 2017
 31-40 C p. 71-77
7 p.
 artikel
4739 Wheel and star-critical Ramsey numbers for quadrilateral Wu, Yali
 2015
 31-40 C p. 260-271
12 p.
 artikel
4740 When Lagged Fibonacci Generators jump Chetry, Moon K.
 2019
 31-40 C p. 64-72
 artikel
4741 Which k -trees are cover–incomparability graphs? Maxová, Jana
 2014
 31-40 C p. 222-227
6 p.
 artikel
4742 Which tree has the smallest A B C index among trees with k leaves? Magnant, Colton
 2015
 31-40 C p. 143-146
4 p.
 artikel
4743 Wiener, edge-Wiener, and vertex-edge-Wiener index of Basilica graphs Cavaleri, Matteo
31-40 C p. 32-49
 artikel
4744 Wiener index and graphs, almost half of whose vertices satisfy Šoltés property Akhmejanova, Margarita
31-40 C p. 37-42
 artikel
4745 Wiener index and Harary index on Hamilton-connected graphs with large minimum degree Zhou, Qiannan
31-40 C p. 180-185
 artikel
4746 Wiener index and vulnerability parameters of graphs Yatauro, Michael
31-40 C p. 56-68
 artikel
4747 Wiener index, Harary index and graph properties Feng, Lihua
 2017
 31-40 C p. 72-83
12 p.
 artikel
4748 Wiener index of Eulerian graphs Gutman, Ivan
 2014
 31-40 C p. 247-250
4 p.
 artikel
4749 Wiener index of quadrangulation graphs Győri, Ervin
31-40 C p. 262-269
 artikel
4750 Window queries for intersecting objects, maximal points and approximations using coresets Chanchary, Farah
31-40 C p. 295-310
 artikel
4751 Wirelength of embedding complete multipartite graphs into certain graphs R., Sundara Rajan
31-40 C p. 221-236
 artikel
4752 Word length perturbations in certain symmetric presentations of dihedral groups Allocca, Michael P.
 2017
 31-40 C p. 33-45
13 p.
 artikel
4753 Word-representability of graphs with respect to split recomposition Dwary, Tithi
31-40 C p. 310-321
 artikel
4754 Word-representability of split graphs generated by morphisms Iamthong, Kittitat
31-40 C p. 284-303
 artikel
4755 Word-representability of Toeplitz graphs Cheon, Gi-Sang
 2019
 31-40 C p. 96-105
 artikel
4756 Word-representability of triangulations of grid-covered cylinder graphs Chen, Herman Z.Q.
 2016
 31-40 C p. 60-70
11 p.
 artikel
4757 Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes Kunihiro, Noboru
31-40 C p. 198-220
 artikel
4758 X A E and X E A robustness of max–min matrices Myšková, Helena
 2019
 31-40 C p. 142-150
 artikel
4759 XSAT and NAE-SAT of linear CNF classes Porschen, Stefan
 2014
 31-40 C p. 1-14
14 p.
 artikel
4760 Y-equivalence and rhombic realization of projective-planar quadrangulations Nakamoto, Atsuhiro
31-40 C p. 98-112
 artikel
4761 Zagreb eccentricity indices of unicyclic graphs Qi, Xuli
 2017
 31-40 C p. 166-174
9 p.
 artikel
4762 Zero-divisor graph of a poset with respect to an automorphism Patil, Avinash
31-40 C p. 604-612
 artikel
4763 Zero forcing and maximum nullity for hypergraphs Hogben, Leslie
31-40 C p. 122-135
 artikel
4764 Zero forcing in iterated line digraphs Ferrero, Daniela
 2019
 31-40 C p. 198-208
 artikel
4765 Zero forcing of generalized hierarchical products Anderson, Sarah E.
31-40 C p. 120-126
 artikel
4766 Zero forcing propagation time on oriented graphs Berliner, Adam
 2017
 31-40 C p. 45-59
15 p.
 artikel
4767 Zero–one laws for k -variable first-order logic of sparse random graphs Razafimahatratra, A.S.
31-40 C p. 121-128
 artikel
4768 Zombie number of the Cartesian product of graphs Keramatipour, Ali
31-40 C p. 545-549
 artikel
                             4768 gevonden resultaten
 
<< vorige   
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland