Digital Library
Close Browse articles from a journal
 
Search for with title:
ABCDEFGHIJKLMNOPQRSTUVWXYZ

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