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

 
<< vorige    volgende >>
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             4674 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
2001 Immune sets in monotone infection rules. Characterization and complexity Fàbrega, Josep
1-10 C p. 202-215
 artikel
2002 Implementing generating functions to obtain power indices with coalition configuration Rodríguez-Veiga, J.
 2016
 1-10 C p. 1-15
15 p.
 artikel
2003 Implicit degree condition for hamiltonicity of 2-heavy graphs Huang, Xing
 2017
 1-10 C p. 126-131
6 p.
 artikel
2004 Implicit representation conjecture for semi-algebraic graphs Fitch, Matthew
 2019
 1-10 C p. 53-62
 artikel
2005 Improper interval edge colorings of graphs Casselgren, Carl Johan
1-10 C p. 164-178
 artikel
2006 Improper odd coloring of IC-planar graphs Chen, Ping
1-10 C p. 74-80
 artikel
2007 Improper sum-list colouring of 2-trees Drgas-Burchardt, Ewa
 2019
 1-10 C p. 73-84
 artikel
2008 Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7 Crawford, Nicholas
1-10 C p. 80-83
 artikel
2009 Improved analysis for reduced round Salsa and Chacha Dey, Sabyasachi
 2017
 1-10 C p. 58-69
 artikel
2010 Improved approximation algorithms for cumulative VRP with stochastic demands Gaur, Daya Ram
1-10 C p. 133-143
 artikel
2011 Improved approximation algorithms for weighted 2-path partitions Bar-Noy, Amotz
 2018
 1-10 C p. 15-37
 artikel
2012 Improved approximation for maximum edge colouring problem Chandran, L. Sunil
1-10 C p. 42-52
 artikel
2013 Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs Jooken, Jorik
1-10 C p. 133-141
 artikel
2014 Improved bounds on the domination number of a tree Desormeaux, Wyatt J.
 2014
 1-10 C p. 88-94
7 p.
 artikel
2015 Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights Averbakh, Igor
 2018
 1-10 C p. 193-199
 artikel
2016 Improved descriptional complexity results on generalized forbidding grammars Fernau, Henning
1-10 C p. 2-18
 artikel
2017 Improved online algorithms for jumbled matching Ghuman, Sukhpal Singh
1-10 C p. 54-66
 artikel
2018 Improved sufficient conditions for k -leaf-connected graphs Ao, Guoyan
1-10 C p. 17-30
 artikel
2019 Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles Erveš, Rija
 2015
 1-10 C p. 90-97
8 p.
 artikel
2020 Improvements on some error-tolerance pooling designs Chang, Huilan
 2016
 1-10 C p. 18-22
5 p.
 artikel
2021 Improving a Nordhaus–Gaddum type bound for total domination using an algorithm involving vertex disjoint stars Joubert, Ernst J.
 2017
 1-10 C p. 95-102
 artikel
2022 Improving the Caro–Wei bound and applications to Turán stability Kelly, Tom
1-10 C p. 33-43
 artikel
2023 Improving the characterization of P-stability for applications in network privacy Salas, Julián
 2016
 1-10 C p. 109-114
6 p.
 artikel
2024 Improving the lower bound on opaque sets for equilateral triangle Izumi, Taisuke
 2016
 1-10 C p. 130-138
9 p.
 artikel
2025 Inapproximability results and bounds for the Helly and Radon numbers of a graph Dourado, Mitre C.
 2017
 1-10 C p. 134-141
 artikel
2026 Inapproximability results related to monophonic convexity Costa, Eurinardo R.
 2015
 1-10 C p. 70-74
5 p.
 artikel
2027 Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs Kress, Dominik
 2018
 1-10 C p. 89-101
 artikel
2028 Incidence choosability of graphs Benmedjdoub, Brahim
 2019
 1-10 C p. 40-55
 artikel
2029 Incidence coloring of graphs with high maximum average degree Bonamy, Marthe
 2017
 1-10 C p. 29-43
 artikel
2030 Incomplete cooperative games with player-centered information Černý, Martin
1-10 C p. 62-79
 artikel
2031 Incremental delay enumeration: Space and time Capelli, Florent
 2019
 1-10 C p. 179-190
 artikel
2032 Independence, matching and packing coloring of the iterated Mycielskian of graphs Dliou, Kamal
1-10 C p. 22-33
 artikel
2033 Independence number and minimum degree for path-factor critical uniform graphs Liu, Hongxia
1-10 C p. 153-158
 artikel
2034 Independence number and spectral radius of cactus graphs Xue, Jie
1-10 C p. 81-93
 artikel
2035 Independent distributions on a multi-branching AND–OR tree of height 2 Shigemizu, Mika
1-10 C p. 274-282
 artikel
2036 Independent domination in finitely defined classes of graphs: Polynomial algorithms Lozin, Vadim
 2015
 1-10 C p. 2-14
13 p.
 artikel
2037 Independent domination in outerplanar graphs Goddard, Wayne
1-10 C p. 52-57
 artikel
2038 Independent domination in subcubic bipartite graphs of girth at least six Henning, Michael A.
 2014
 1-10 C p. 399-403
5 p.
 artikel
2039 Independent domination in the graph defined by two consecutive levels of the n -cube Kalinowski, Thomas
1-10 C p. 161-172
 artikel
2040 Independent domination versus packing in subcubic graphs Cho, Eun-Kyung
1-10 C p. 132-134
 artikel
2041 Independent ( k + 1 ) -domination in k -trees Borowiecki, Mieczysław
1-10 C p. 99-110
 artikel
2042 Independent Roman { 2 } -domination in graphs Rahmouni, Abdelkader
 2018
 1-10 C p. 408-414
 artikel
2043 Independent-set reconfiguration thresholds of hereditary graph classes de Berg, Mark
 2018
 1-10 C p. 165-182
 artikel
2044 Independent sets in Line of Sight networks Sangha, Pavan
1-10 C p. 100-115
 artikel
2045 Independent vertex sets in the Zykov sum Liao, Yunhua
1-10 C p. 133-137
 artikel
2046 In-depth analysis of granular local search for capacitated vehicle routing Becker, Christian
1-10 C p. 61-86
 artikel
2047 Index 1999
 1-10 C p. 481-482
2 p.
 artikel
2048 Indicated coloring game on Cartesian products of graphs Brešar, Boštjan
1-10 C p. 320-326
 artikel
2049 Indicated coloring of matroids Lasoń, Michał
 2014
 1-10 C p. 241-243
3 p.
 artikel
2050 Induced cycles in triangle graphs Lakshmanan S, Aparna
 2016
 1-10 C p. 264-275
12 p.
 artikel
2051 Induced forests in some distance-regular graphs Gunderson, Karen
1-10 C p. 290-300
 artikel
2052 Induced 2-regular subgraphs in k -chordal cubic graphs Henning, Michael A.
 2016
 1-10 C p. 73-79
7 p.
 artikel
2053 Induced star partition of graphs Shalu, M.A.
1-10 C p. 81-91
 artikel
2054 Induced Turán problem in bipartite graphs Axenovich, Maria
1-10 C p. 497-505
 artikel
2055 Inequalities between the K k -isolation number and the independent K k -isolation number of a graph Favaron, Odile
1-10 C p. 93-97
 artikel
2056 Inertia and distance energy of line graphs of unicyclic graphs Zhang, Xiaoling
 2019
 1-10 C p. 222-233
 artikel
2057 Inexact tree pattern matching with 1-degree edit distance using finite automata Šestáková, Eliška
1-10 C p. 78-97
 artikel
2058 Infection in hypergraphs Bergen, Ryan
 2018
 1-10 C p. 43-56
 artikel
2059 Infinite chromatic games Janczewski, Robert
1-10 C p. 138-146
 artikel
2060 Infinite classes of generalised complete permutations Cepak, Nastja
1-10 C p. 24-33
 artikel
2061 Infinite classes of vectorial plateaued functions, permutations and complete permutations Pasalic, E.
 2016
 1-10 C p. 177-184
8 p.
 artikel
2062 Infinite family of 3-connected cubic transmission irregular graphs Dobrynin, Andrey A.
 2019
 1-10 C p. 151-157
 artikel
2063 Infinite grid exploration with synchronous myopic robots without chirality Bramas, Quentin
1-10 C p. 193-214
 artikel
2064 Infinitely many minimal classes of graphs of unbounded clique-width Collins, A.
 2018
 1-10 C p. 145-152
 artikel
2065 Infinite quasi-transitive digraphs with domination number 2 Galeana-Sánchez, Hortensia
 2017
 1-10 C p. 44-50
7 p.
 artikel
2066 Infinitesimal rigidity and prestress stability for frameworks in normed spaces Dewar, Sean
1-10 C p. 425-438
 artikel
2067 Influence and interaction indexes for pseudo-Boolean functions: A unified least squares approach Marichal, Jean-Luc
 2014
 1-10 C p. 13-27
15 p.
 artikel
2068 Information dissemination and confusion in signed networks Jin, Ligang
1-10 C p. 99-106
 artikel
2069 Informative path planning as a maximum traveling salesman problem with submodular rewards Jawaid, Syed Talha
 2015
 1-10 C p. 112-127
16 p.
 artikel
2070 Initial non-repetitive complexity of infinite words Nicholson, Jeremy
 2016
 1-10 C p. 114-122
9 p.
 artikel
2071 Injective chromatic index of sparse graphs Bu, Yuehua
1-10 C p. 9-16
 artikel
2072 Injective coloring of some subclasses of bipartite graphs and chordal graphs Panda, B.S.
1-10 C p. 68-87
 artikel
2073 Injective edge chromatic index of sparse graphs Hu, Xiaolan
1-10 C p. 50-56
 artikel
2074 Injective edge coloring of graphs with maximum degree 5 Zhu, Junlei
1-10 C p. 119-126
 artikel
2075 In Memoriam Walter Kern Hochstättler, Winfried
1-10 C p. 2-3
 artikel
2076 Inner-core and outer-core functions of partially defined Boolean functions Makino, Kazuhisa
 1999
 1-10 C p. 443-460
18 p.
 artikel
2077 In-place algorithms for computing a largest clique in geometric intersection graphs De, Minati
 2014
 1-10 C p. 58-70
13 p.
 artikel
2078 Insight into the computation of Steiner minimal trees in Euclidean space of general dimension Fampa, Marcia
1-10 C p. 4-19
 artikel
2079 Integer k -matchings of graphs Liu, Yan
 2018
 1-10 C p. 118-128
 artikel
2080 Integer k -matchings of graphs: k -Berge–Tutte formula, k -factor-critical graphs and k -barriers Liu, Yan
1-10 C p. 120-128
 artikel
2081 Integer orbits in rectangular lattice billiards Dulio, Paolo
1-10 C p. 302-319
 artikel
2082 Integer sequence discovery from small graphs Hoppe, Travis
 2016
 1-10 C p. 172-181
10 p.
 artikel
2083 Integral cographs Allem, Luiz Emilio
1-10 C p. 153-167
 artikel
2084 Integral trees with diameter 6 Xi, Fangxu
1-10 C p. 76-90
 artikel
2085 Integral values of generating functions of recursive sequences Knapp, M.
1-10 C p. 31-43
 artikel
2086 Interactive unawareness in the graph model for multilateral conflicts Rêgo, Leandro Chaves
1-10 C p. 31-46
 artikel
2087 Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems Gauthier, Jean Bertrand
1-10 C p. 131-153
 artikel
2088 Interdiction problems on planar graphs Pan, Feng
 2016
 1-10 C p. 215-231
17 p.
 artikel
2089 Internet routing between autonomous systems: Fast algorithms for path trading Berger, André
 2015
 1-10 C p. 8-17
10 p.
 artikel
2090 Interplay between resiliency and polynomial degree — Recursive amplification, higher order sensitivity and beyond Maitra, Subhamoy
1-10 C p. 138-159
 artikel
2091 Interpretations for the Tutte polynomials of morphisms of matroids Kochol, Martin
1-10 C p. 210-216
 artikel
2092 Intersection graph of maximal stars Gomes, Guilherme de C.M.
1-10 C p. 567-580
 artikel
2093 Intersection graphs of induced subtrees of any graph and a generalization of chordal graphs De Caria, Pablo
1-10 C p. 171-183
 artikel
2094 Intersection graphs of L-shapes and segments in the plane Felsner, Stefan
 2016
 1-10 C p. 48-55
8 p.
 artikel
2095 Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs Bonomo-Braberman, Flavia
1-10 C p. 53-77
 artikel
2096 Intersection of chordal graphs and some related partition problems Abueida, Atif
1-10 C p. 244-257
 artikel
2097 Intersection of longest paths in graph classes Cerioli, Márcia R.
1-10 C p. 96-105
 artikel
2098 Interval edge-colorings of K 1 , m , n Grzesik, A.
 2014
 1-10 C p. 140-145
6 p.
 artikel
2099 Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations Changat, Manoj
1-10 C p. 53-62
 artikel
2100 Interval incidence coloring of bipartite graphs Janczewski, Robert
 2014
 1-10 C p. 131-140
10 p.
 artikel
2101 Interval incidence graph coloring Janczewski, Robert
 2015
 1-10 C p. 73-83
11 p.
 artikel
2102 Interval orders with two interval lengths Boyadzhiyska, Simona
 2019
 1-10 C p. 52-63
 artikel
2103 Interval robustness of (interval) max-plus matrices Myšková, Helena
1-10 C p. 8-19
 artikel
2104 Interval scheduling maximizing minimum coverage Mäkinen, Veli
 2017
 1-10 C p. 130-135
6 p.
 artikel
2105 Inverse minimum flow problem under the weighted sum-type Hamming distance Liu, Longcheng
 2017
 1-10 C p. 101-112
12 p.
 artikel
2106 Inverse optimization problems with multiple weight functions Bérczi, Kristóf
1-10 C p. 134-147
 artikel
2107 Inverse quickest center location problem on a tree Keshtkar, Iman
 2019
 1-10 C p. 188-202
 artikel
2108 Investigating results and performance of search and construction algorithms for word-based LFSRs, σ -LFSRs Bishoi, Susil Kumar
 2018
 1-10 C p. 90-98
 artikel
2109 Investigating the recoverable robust single machine scheduling problem under interval uncertainty Bold, Matthew
1-10 C p. 99-114
 artikel
2110 Investigations on c -boomerang uniformity and perfect nonlinearity Stănică, Pantelimon
1-10 C p. 297-314
 artikel
2111 Irreducibility of recombination Markov chains in the triangular lattice Cannon, Sarah
1-10 C p. 75-130
 artikel
2112 Irredundance graphs Mynhardt, C.M.
1-10 C p. 36-48
 artikel
2113 Irregular independence and irregular domination Borg, Peter
 2019
 1-10 C p. 76-84
 artikel
2114 Irregularities of maximal k -degenerate graphs Bickle, Allan
1-10 C p. 70-87
 artikel
2115 Isolation number of maximal outerplanar graphs Tokunaga, Shin-ichi
 2019
 1-10 C p. 215-218
 artikel
2116 Isolation of connected graphs Borg, Peter
1-10 C p. 154-165
 artikel
2117 Isometric Hamming embeddings of weighted graphs Berleant, Joseph
1-10 C p. 119-128
 artikel
2118 Isomorphism between circulants and Cartesian products of cycles Bogdanowicz, Zbigniew R.
 2017
 1-10 C p. 40-43
4 p.
 artikel
2119 Italian domination of Cartesian products of directed cycles van Bommel, Christopher M.
1-10 C p. 82-86
 artikel
2120 k -Ary spanning trees contained in tournaments Ai, Jiangdong
1-10 C p. 141-146
 artikel
2121 k -broadcast domination and k -multipacking Henning, Michael A.
 2018
 1-10 C p. 241-251
 artikel
2122 k -circular matroids of graphs De Jesús, José F.
 2017
 1-10 C p. 33-50
18 p.
 artikel
2123 Kemeny’s constant and Kirchhoffian indices for conjoined highly symmetric graphs Palacios, José Luis
1-10 C p. 215-220
 artikel
2124 Kemeny’s constant for a graph with bridges Breen, Jane
1-10 C p. 20-35
 artikel
2125 Kemeny’s constant for several families of graphs and real-world networks Kooij, Robert E.
1-10 C p. 96-107
 artikel
2126 Kempe classes and almost bipartite graphs Cranston, Daniel W.
1-10 C p. 94-98
 artikel
2127 Kernelization for feedback vertex set via elimination distance to a forest Dekker, David J.C.
1-10 C p. 192-214
 artikel
2128 Kernelization of edge perfect code and its variants Jiang, Minghui
 2016
 1-10 C p. 145-152
8 p.
 artikel
2129 Kernels by rainbow paths in arc-colored tournaments Bai, Yandong
1-10 C p. 14-21
 artikel
2130 k -foldability of words Bjorkman, Beth
 2019
 1-10 C p. 19-30
 artikel
2131 K 4 -free planar minimal bricks with the maximum number of edges Zhou, Jinqiu
1-10 C p. 92-102
 artikel
2132 Kings and Heirs: A characterization of the ( 2 , 2 ) -domination graphs of tournaments Factor, Kim A.S.
 2016
 1-10 C p. 142-149
8 p.
 artikel
2133 Kirchhoffian indices for weighted digraphs Bianchi, Monica
 2019
 1-10 C p. 142-154
 artikel
2134 Kirchhoff index and degree Kirchhoff index of complete multipartite graphs Bapat, Ravindra B.
 2017
 1-10 C p. 41-49
 artikel
2135 K 5 , 5 is fully reconstructible in ℂ 3 Bernstein, Daniel Irving
1-10 C p. 442-447
 artikel
2136 K 1 , 2 -isolation in graphs Zhang, Gang
1-10 C p. 365-374
 artikel
2137 k -isolation in graphs Zhang, Gang
1-10 C p. 99-111
 artikel
2138 König graphs for 3-paths and 3-cycles Alekseev, V.E.
 2016
 1-10 C p. 1-5
5 p.
 artikel
2139 Knocking out P k -free graphs Johnson, Matthew
 2015
 1-10 C p. 100-108
9 p.
 artikel
2140 k -path-connectivity of the complete balanced tripartite graph K n , n , n for n + 1 ≤ k ≤ 2 n − 4 Li, Shasha
1-10 C p. 279-294
 artikel
2141 k -planar crossing number of random graphs and random regular graphs Asplund, John
1-10 C p. 419-422
 artikel
2142 k -restricted edge connectivity in ( p + 1 ) -clique-free graphs Wang, Shiying
 2015
 1-10 C p. 255-259
5 p.
 artikel
2143 k -tuple colorings of the Cartesian product of graphs Bonomo, Flavia
 2018
 1-10 C p. 177-182
 artikel
2144 Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two Karst, Nathaniel
 2014
 1-10 C p. 101-108
8 p.
 artikel
2145 Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem Galli, Laura
1-10 C p. 36-51
 artikel
2146 Laplacian and Wiener index of extension of zero divisor graph Bora, Pallabi
1-10 C p. 229-237
 artikel
2147 Laplacian pair state transfer in Q-graph Jiang, Ming
1-10 C p. 239-258
 artikel
2148 Laplacian state transfer in edge complemented coronas Wang, Jing
1-10 C p. 1-14
 artikel
2149 Large Cayley graphs of small diameter Erskine, Grahame
 2018
 1-10 C p. 202-214
 artikel
2150 Large induced forests in planar graphs with girth 4 Dross, François
 2019
 1-10 C p. 96-106
 artikel
2151 Largest domination number and smallest independence number of forests with given degree sequence Gentner, Michael
 2016
 1-10 C p. 181-187
7 p.
 artikel
2152 Large trees with maximal inverse sum indeg index have no vertices of degree 2 or 3 Wu, Yuehan
1-10 C p. 131-138
 artikel
2153 Large-width bounds for learning half-spaces on distance spaces Anthony, Martin
 2018
 1-10 C p. 73-89
 artikel
2154 L ( 2 , 1 ) -colorings and irreducible no-hole colorings of the direct product of graphs Mandal, Nibedita
1-10 C p. 186-200
 artikel
2155 Leafy spanning arborescences in DAGs Fernandes, Cristina G.
1-10 C p. 217-227
 artikel
2156 Learning Variable Neighborhood Search for a scheduling problem with time windows and rejections Thevenin, Simon
 2019
 1-10 C p. 344-353
 artikel
2157 Least Q -eigenvalues of nonbipartite 2-connected graphs Yu, Guanglong
1-10 C p. 71-79
 artikel
2158 l 1 -embeddability under the edge-gluing operation on some nonbipartite graphs Wang, Guangfu
1-10 C p. 79-84
 artikel
2159 Letter graphs and geometric grid classes of permutations: Characterization and recognition Alecu, Bogdan
1-10 C p. 482-494
 artikel
2160 Letter graphs and modular decomposition Ferguson, Robert
1-10 C p. 215-220
 artikel
2161 Level-2 networks from shortest and longest distances Huber, Katharina T.
1-10 C p. 138-165
 artikel
2162 Leveraging duality for the gamma-robust segment routing traffic engineering problem Callebaut, Hugo
1-10 C p. 199-212
 artikel
2163 Lexicographical polytopes Barbato, Michele
 2018
 1-10 C p. 3-7
 artikel
2164 Lexicographic ranking and unranking of derangements in cycle notation Mikawa, Kenji
 2014
 1-10 C p. 164-169
6 p.
 artikel
2165 Liar’s dominating set problem on unit disk graphs Jallu, Ramesh K.
1-10 C p. 91-99
 artikel
2166 Liar’s dominating sets in graphs Alimadadi, Abdollah
 2016
 1-10 C p. 204-210
7 p.
 artikel
2167 Lift-and-project ranks of the stable set polytope of joined a -perfect graphs Bianchi, S.
 2016
 1-10 C p. 176-184
 artikel
2168 Lifting for mixed integer programs with variable upper bounds Shebalov, Sergey
 2015
 1-10 C p. 226-250
25 p.
 artikel
2169 Light structures in 1-planar graphs with an application to linear 2-arboricity Liu, Juan
 2019
 1-10 C p. 120-130
 artikel
2170 2-limited broadcast domination in subcubic graphs Henning, Michael A.
1-10 C p. 691-706
 artikel
2171 2-limited broadcast domination on grid graphs Slobodin, Aaron
1-10 C p. 158-178
 artikel
2172 2-limited dominating broadcasts on cubic graphs without induced 4-cycles Park, Boram
1-10 C p. 178-184
 artikel
2173 Limited visibility Cops and Robber Clarke, N.E.
1-10 C p. 53-64
 artikel
2174 Limit points of spectra for first-order properties of random hypergraphs Popova, S.N.
1-10 C p. 134-142
 artikel
2175 Limits of k -dimensional poset sequences Corrêa, Ricardo Cordeiro
 2018
 1-10 C p. 208-219
 artikel
2176 Linear and cyclic distance-three labellings of trees King, Deborah
 2014
 1-10 C p. 109-120
12 p.
 artikel
2177 Linear and non-linear inequalities on the inverse sum indeg index Gutman, Ivan
 2019
 1-10 C p. 123-134
 artikel
2178 Linear kernels for k -tuple and liar’s domination in bounded genus graphs Bishnu, Arijit
 2017
 1-10 C p. 67-77
11 p.
 artikel
2179 Linear read-once and related Boolean functions Lozin, Vadim
 2018
 1-10 C p. 16-27
 artikel
2180 Linear time algorithms for Euclidean 1-center in ℜ d with non-linear convex constraints Das, Sandip
1-10 C p. 71-85
 artikel
2181 Linear-time algorithms for three domination-based separation problems in block graphs Argiroffo, Gabriela R.
1-10 C p. 6-41
 artikel
2182 Linear-time fitting of a k -step function Bhattacharya, Binay
1-10 C p. 43-52
 artikel
2183 Line segment disk cover Basappa, Manjanna
1-10 C p. 261-271
 artikel
2184 Link dimension and exact construction of graphs from distance vectors Mahindre, Gunjan S.
1-10 C p. 160-171
 artikel
2185 List backbone colouring of graphs Bu, Yuehua
 2014
 1-10 C p. 45-51
7 p.
 artikel
2186 List coloring in the absence of two subgraphs Golovach, Petr A.
 2014
 1-10 C p. 123-130
8 p.
 artikel
2187 Listing the bonds of a graph in O ˜ ( n ) –delay Raffaele, Alice
1-10 C p. 105-121
 artikel
2188 List injective edge-coloring of subcubic graphs Lv, Jian-Bo
1-10 C p. 163-170
 artikel
2189 List matrix partitions of graphs representing geometric configurations Valadkhan, Payam
 2019
 1-10 C p. 237-243
 artikel
2190 List rankings and on-line list rankings of graphs McDonald, Daniel C.
 2016
 1-10 C p. 109-125
17 p.
 artikel
2191 List r -dynamic coloring of graphs with small maximum average degree Zhu, Junlei
 2019
 1-10 C p. 254-263
 artikel
2192 List recoloring of planar graphs Chandran, L. Sunil
1-10 C p. 71-87
 artikel
2193 List star edge-coloring of claw-free subcubic multigraphs Cui, Qing
1-10 C p. 258-264
 artikel
2194 List star edge-coloring of k -degenerate graphs and K 4 -minor free graphs Kerdjoudj, Samia
 2019
 1-10 C p. 268-275
 artikel
2195 List star edge coloring of sparse graphs Kerdjoudj, Samia
 2018
 1-10 C p. 115-125
 artikel
2196 L ( 2 , 1 ) -labeling of disk intersection graphs Chybowska-Sokół, Joanna
1-10 C p. 71-81
 artikel
2197 L ( 2 , 1 ) -Labeling of Kneser graphs and coloring squares of Kneser graphs Shao, Zhendong
 2017
 1-10 C p. 106-114
9 p.
 artikel
2198 L 1 -norm ball for CSIDH: Optimal strategy for choosing the secret key space Nakagawa, Kohei
1-10 C p. 70-88
 artikel
2199 Local antimagic orientations of d -degenerate graphs Hu, Jie
 2019
 1-10 C p. 206-215
 artikel
2200 Local certification of graphs with bounded genus Feuilloley, Laurent
1-10 C p. 9-36
 artikel
2201 Local diagnosability of bipartite graphs with conditional faulty edges under Preparata, Metze and Chien’s model Ren, Yunxia
1-10 C p. 286-294
 artikel
2202 Local Irregularity Conjecture vs. cacti Sedlar, Jelena
1-10 C p. 115-133
 artikel
2203 Localization game for random graphs Dudek, Andrzej
1-10 C p. 202-214
 artikel
2204 Localization game on geometric and planar graphs Bosek, Bartłomiej
 2018
 1-10 C p. 30-39
 artikel
2205 Locally complete consistent F-augmented contexts: A category-theoretic representation of algebraic L-domains Guo, Lankun
 2018
 1-10 C p. 53-63
 artikel
2206 Locally definable vertex set properties are efficiently enumerable Blind, Sarah
1-10 C p. 186-202
 artikel
2207 Locally defined independence systems on graphs Amano, Yuki
1-10 C p. 1-16
 artikel
2208 Locally dense supereulerian digraphs Algefari, Mansour J.
 2018
 1-10 C p. 24-31
 artikel
2209 Locally injective k -colourings of planar graphs Kratochvil, Jan
 2014
 1-10 C p. 53-61
9 p.
 artikel
2210 Locally irregular edge-coloring of subcubic graphs Lužar, Borut
1-10 C p. 136-148
 artikel
2211 Local WL invariance and hidden shades of regularity Fuhlbrück, Frank
1-10 C p. 191-198
 artikel
2212 Locating a discrete subtree of minimum variance on trees: New strategies to tackle a very hard problem Puerto, Justo
1-10 C p. 78-92
 artikel
2213 Locating battery charging stations to facilitate almost shortest paths Arkin, Esther M.
 2019
 1-10 C p. 10-16
 artikel
2214 Locating-dominating sets in local tournaments Bellitto, Thomas
1-10 C p. 14-24
 artikel
2215 Locating–dominating sets in twin-free graphs Foucaud, Florent
 2016
 1-10 C p. 52-58
7 p.
 artikel
2216 Locating domination in bipartite graphs and their complements Hernando, C.
 2019
 1-10 C p. 195-203
 artikel
2217 Locating sets of vertices on Hamiltonian cycles Faudree, Ralph J.
 2016
 1-10 C p. 107-114
8 p.
 artikel
2218 Location of weighted anti-ordered median straight lines with Euclidean distances Lozano, Antonio J.
 2015
 1-10 C p. 122-133
12 p.
 artikel
2219 Location problems with continuous demand and unreliable facilities: Applications of families of incremental Voronoi diagrams Averbakh, Igor
1-10 C p. 36-55
 artikel
2220 Location routing problems on trees Aráoz, Julián
 2019
 1-10 C p. 1-18
 artikel
2221 Loopy, Hankel, and combinatorially skew-Hankel tournaments Brualdi, Richard A.
 2015
 1-10 C p. 37-59
23 p.
 artikel
2222 Lossless text compression by means of binary-coded ternary number representation Zavadskyi, Igor O.
1-10 C p. 15-22
 artikel
2223 Lot sizing with minimum order quantity Park, Young Woong
 2015
 1-10 C p. 235-254
20 p.
 artikel
2224 Lovász–Schrijver PSD-operator and the stable set polytope of claw-free graphs Bianchi, Silvia M.
1-10 C p. 70-86
 artikel
2225 Low c -differential uniformity of the swapped inverse function in odd characteristic Jeong, Jaeseong
1-10 C p. 195-209
 artikel
2226 Low complexity bit-parallel multiplier for F 2 n defined by repeated polynomials Chang, Nam Su
 2018
 1-10 C p. 2-12
 artikel
2227 Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines Angel, Eric
 2014
 1-10 C p. 1-10
10 p.
 artikel
2228 Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph Hertz, Alain
1-10 C p. 69-81
 artikel
2229 Lower bounds for monotone counting circuits Jukna, Stasys
 2016
 1-10 C p. 139-152
14 p.
 artikel
2230 Lower bounds for protrusion replacement by counting equivalence classes Jansen, Bart M.P.
1-10 C p. 12-27
 artikel
2231 Lower bounds for the Event Scheduling Problem with Consumption and Production of Resources Carlier, J.
 2018
 1-10 C p. 178-194
 artikel
2232 Lower bounds for the geometric–arithmetic index of graphs with pendant and fully connected vertices Bianchi, Monica
 2019
 1-10 C p. 53-59
 artikel
2233 Lower bounds for the independence and k -independence number of graphs using the concept of degenerate degrees Zaker, Manouchehr
 2016
 1-10 C p. 204-216
13 p.
 artikel
2234 Lower bounds for the Laplacian energy of bipartite graphs Palacios, José Luis
 2018
 1-10 C p. 213-217
 artikel
2235 Lower bounds for treewidth of product graphs Kozawa, Kyohei
 2014
 1-10 C p. 251-258
8 p.
 artikel
2236 Lower bounds on matching energy of graphs Khalashi Ghezelahmad, S.
1-10 C p. 153-159
 artikel
2237 Lower bounds on paraclique density Hagan, Ronald D.
 2016
 1-10 C p. 208-212
5 p.
 artikel
2238 Lower bounds on the general first Zagreb index of graphs with low cyclomatic number Dehgardi, Nasrin
1-10 C p. 52-61
 artikel
2239 Lower bounds on the integrality ratio of the subtour LP for the traveling salesman problem Zhong, Xianghui
1-10 C p. 109-129
 artikel
2240 Lower bounds on the irregularity of trees and unicyclic graphs Azari, Mahdieh
1-10 C p. 136-144
 artikel
2241 Lower bounds on the mim-width of some graph classes Mengel, Stefan
 2018
 1-10 C p. 28-32
 artikel
2242 Lower bounds on Tuza constants for transversals in linear uniform hypergraphs Henning, Michael A.
1-10 C p. 12-22
 artikel
2243 Low time complexity algorithms for path computation in Cayley Graphs Aguirre-Guerrero, D.
 2019
 1-10 C p. 218-225
 artikel
2244 LP-based dual bounds for the maximum quasi-clique problem Marinelli, Fabrizio
1-10 C p. 118-140
 artikel
2245 L ( p , q ) -labeling of a graph embeddable on the torus Ma, Dengju
 2014
 1-10 C p. 70-76
7 p.
 artikel
2246 L ( p , q ) -labeling of planar graphs with small girth Dong, Wei
1-10 C p. 592-601
 artikel
2247 L ( p , q ) -labelings of subdivisions of graphs Chang, Fei-Huang
1-10 C p. 264-270
 artikel
2248 LP-relaxations for tree augmentation Kortsarz, Guy
 2018
 1-10 C p. 94-105
 artikel
2249 Mahonian STAT on rearrangement class of words Fu, Shishuo
 2019
 1-10 C p. 134-141
 artikel
2250 Maintaining balanced trees for structured distributed streaming systems Giroire, F.
 2017
 1-10 C p. 176-188
 artikel
2251 Maintaining centdians in a fully dynamic forest with top trees Wang, Hung-Lung
 2015
 1-10 C p. 310-315
6 p.
 artikel
2252 Majority coloring game Bosek, Bartłomiej
 2019
 1-10 C p. 15-20
 artikel
2253 Majority dynamics with one nonconformist Haslegrave, John
 2017
 1-10 C p. 32-39
8 p.
 artikel
2254 Majority problems of large query size Gerbner, Dániel
 2019
 1-10 C p. 124-134
 artikel
2255 Majority rule on rhombus tilings and Condorcet super-domains Danilov, Vladimir I.
1-10 C p. 85-96
 artikel
2256 Majorization and the minimum number of dominating sets Skupień, Zdzisław
 2014
 1-10 C p. 295-302
8 p.
 artikel
2257 Maker–Breaker total domination game Gledel, Valentin
1-10 C p. 96-107
 artikel
2258 Makespan optimization in a single-machine scheduling problem with dynamic job ready times—Complexity and algorithms Gorczyca, Mateusz
 2015
 1-10 C p. 162-168
7 p.
 artikel
2259 Making a C 6 -free graph C 4 -free and bipartite Győri, Ervin
 2016
 1-10 C p. 133-136
4 p.
 artikel
2260 Many-to-many matching with max–min preferences Hatfield, John William
 2014
 1-10 C p. 235-240
6 p.
 artikel
2261 Many-to-many two-disjoint path covers in cylindrical and toroidal grids Park, Jung-Heum
 2015
 1-10 C p. 168-191
24 p.
 artikel
2262 Markov word patterns and a relation on α -words Chuan, Wai-Fong
 2016
 1-10 C p. 63-87
25 p.
 artikel
2263 Matching and spanning trails in digraphs Liu, Juan
1-10 C p. 417-431
 artikel
2264 Matching anti-forcing polynomials of catacondensed hexagonal systems Zhao, Shuang
1-10 C p. 54-67
 artikel
2265 Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithms Komusiewicz, Christian
1-10 C p. 44-58
 artikel
2266 Matching extension and matching exclusion via the size or the spectral radius of graphs Miao, Shujing
1-10 C p. 214-230
 artikel
2267 Matching extension in prism graphs Aldred, R.E.L.
 2017
 1-10 C p. 25-32
8 p.
 artikel
2268 Matching polynomials of path-trees of a complete bipartite graph Chen, Haiyan
1-10 C p. 173-179
 artikel
2269 Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs Lin, Ruizhi
 2017
 1-10 C p. 104-117
14 p.
 artikel
2270 Matching preclusion for cube-connected cycles Li, Qiuli
 2015
 1-10 C p. 118-126
9 p.
 artikel
2271 Matching preclusion for direct product of regular graphs Lin, Ruizhi
1-10 C p. 221-230
 artikel
2272 Matching preclusion for k -ary n -cubes with odd k ≥ 3 Hu, Xiaomin
 2017
 1-10 C p. 90-100
11 p.
 artikel
2273 Matching preclusion for n -grid graphs Ding, Qi
 2018
 1-10 C p. 194-206
 artikel
2274 Matching preclusion for vertex-transitive networks Li, Qiuli
 2016
 1-10 C p. 90-98
9 p.
 artikel
2275 Matchings in bipartite graphs with a given number of cuts Liu, Jinfeng
1-10 C p. 303-309
 artikel
2276 Matchings in graphs and groups Jarden, Adi
1-10 C p. 216-224
 artikel
2277 Matchings in graphs with a given number of cuts Liu, Jinfeng
1-10 C p. 473-481
 artikel
2278 Mathematical model-based security management framework for future ICT outsourcing project Moon, Jewook
 2018
 1-10 C p. 67-77
 artikel
2279 Mathematical properties of the gene duplication cost Górecki, Paweł
 2019
 1-10 C p. 114-122
 artikel
2280 Matrices inducing generalized metric on sequences Araujo, Eloi
1-10 C p. 135-154
 artikel
2281 Matrix partitions of split graphs Feder, Tomás
 2014
 1-10 C p. 91-96
6 p.
 artikel
2282 Matrix power inequalities and the number of walks in graphs Täubig, Hanjo
1-10 C p. 122-129
 artikel
2283 Matrix representation of consensus and dissent stabilities in the graph model for conflict resolution Xu, Haiyan
 2019
 1-10 C p. 205-217
 artikel
2284 Matrix representation of stability definitions in the graph model for conflict resolution with grey-based preferences Wang, Dayong
1-10 C p. 106-125
 artikel
2285 Matroid optimization problems with monotone monomials in the objective Fischer, Anja
1-10 C p. 20-35
 artikel
2286 Matroid union — Graphic? Binary? Neither? Csehi, Csongor Gy.
 2016
 1-10 C p. 75-83
9 p.
 artikel
2287 MAX for k -independence in multigraphs Francetić, Nevena
 2019
 1-10 C p. 56-68
 artikel
2288 Maximal induced matchings in K 4 -free and K 5 -free graphs Basavaraju, Manu
1-10 C p. 407-418
 artikel
2289 Maximal intervals of decrease and inflection points for node reliability Brown, Jason
1-10 C p. 40-44
 artikel
2290 Maximally connected p -partite uniform hypergraphs Shan, Erfang
 2019
 1-10 C p. 188-195
 artikel
2291 Maximally edge-connected graphs and Zeroth-order general Randić index for 0 < α < 1 Su, Guifu
 2014
 1-10 C p. 261-268
8 p.
 artikel
2292 Maximal strongly connected cliques in directed graphs: Algorithms and bounds Conte, Alessio
1-10 C p. 237-252
 artikel
2293 Maxima of the A α -index of graphs with given size and domination number Zhang, Rong
1-10 C p. 35-45
 artikel
2294 Maxima of the Q -index for 3 K 3 -free graphs Zhang, Yanting
1-10 C p. 448-456
 artikel
2295 Maxima of the Q -index of leaf-free graphs with given size Wang, Shujing
1-10 C p. 161-173
 artikel
2296 Maxima of the Q -index of non-bipartite graphs: Forbidden short odd cycles Miao, Lu
1-10 C p. 104-114
 artikel
2297 Maximizing the degree powers of graphs with fixed size Zhang, Liwen
1-10 C p. 15-24
 artikel
2298 Maximizing the number of cliques in graphs with given matching number Duan, Xiuzhuan
1-10 C p. 110-117
 artikel
2299 Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations Rossi, André
 2016
 1-10 C p. 123-136
14 p.
 artikel
2300 Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size Guo, Shu-Guang
1-10 C p. 204-211
 artikel
2301 Maximizing the strong triadic closure in split graphs and proper interval graphs Konstantinidis, Athanasios L.
1-10 C p. 79-95
 artikel
2302 Maximum atom-bond connectivity index with given graph parameters Zhang, Xiu-Mei
 2016
 1-10 C p. 208-217
10 p.
 artikel
2303 Maximum bipartite subgraphs in graphs without short cycles Lin, Jing
1-10 C p. 18-25
 artikel
2304 Maximum bisections of graphs without cycles of length four and five Wu, Shufei
1-10 C p. 209-220
 artikel
2305 Maximum cuts in edge-colored graphs Faria, Luerbio
1-10 C p. 229-234
 artikel
2306 Maximum eccentric connectivity index for graphs with given diameter Hauweele, Pierre
 2019
 1-10 C p. 102-111
 artikel
2307 Maximum energy bicyclic graphs containing two odd cycles with one common vertex Gao, Jing
1-10 C p. 1-21
 artikel
2308 Maximum Estrada index of bicyclic graphs Wang, Long
 2015
 1-10 C p. 194-199
6 p.
 artikel
2309 Maximum external Wiener index of graphs Dimitrov, Darko
 2019
 1-10 C p. 331-337
 artikel
2310 Maximum independent sets near the upper bound Schiermeyer, Ingo
 2019
 1-10 C p. 186-190
 artikel
2311 Maximum induced forests in random graphs Krivoshapko, M.
1-10 C p. 211-213
 artikel
2312 Maximum Laplacian energy of unicyclic graphs Das, Kinkar Ch.
 2017
 1-10 C p. 71-81
11 p.
 artikel
2313 Maximum locally irregular induced subgraphs via minimum irregulators Fioravantes, Foivos
1-10 C p. 168-189
 artikel
2314 Maximum matching width: New characterizations and a fast algorithm for dominating set Jeong, Jisu
 2018
 1-10 C p. 114-124
 artikel
2315 Maximum nullity and zero forcing number on graphs with maximum degree at most three Alishahi, Meysam
1-10 C p. 179-194
 artikel
2316 Maximum probability shortest path problem Cheng, Jianqiang
 2015
 1-10 C p. 40-48
9 p.
 artikel
2317 Maximum renamable Horn sub-CNFs Boros, Endre
 1999
 1-10 C p. 29-40
12 p.
 artikel
2318 Maximum Resistance-Harary index of cacti Fang, Wei
 2018
 1-10 C p. 160-170
 artikel
2319 Maximum 0-1 timed matching on temporal graphs Mandal, Subhrangsu
1-10 C p. 310-326
 artikel
2320 Maximum weighted matching with few edge crossings for 2-layered bipartite graph Haraguchi, Kazuya
1-10 C p. 40-52
 artikel
2321 Maximum weight independent set for ℓ claw-free graphs in polynomial time Brandstädt, Andreas
 2018
 1-10 C p. 57-64
 artikel
2322 Maximum Weight Independent Sets for ( P 7 ,triangle)-free graphs in polynomial time Brandstädt, Andreas
 2018
 1-10 C p. 57-65
 artikel
2323 Maximum weight relaxed cliques and Russian Doll Search revisited Gschwind, Timo
 2018
 1-10 C p. 131-138
 artikel
2324 Mean deep coalescence cost under exchangeable probability distributions Than, C.V.
 2014
 1-10 C p. 11-26
16 p.
 artikel
2325 Measurement and algorithm for conditional local diagnosis of regular networks under the MM* model Yuan, Jun
1-10 C p. 46-67
 artikel
2326 Measures of closeness to cordiality for graphs Brahmbhatt, Anand
1-10 C p. 157-166
 artikel
2327 Memory optimal dispersion by anonymous mobile robots Das, Archak
1-10 C p. 171-182
 artikel
2328 Meta-kernelization using well-structured modulators Eiben, Eduard
 2018
 1-10 C p. 153-167
 artikel
2329 Metric and ultrametric inequalities for directed graphs Gurvich, Vladimir
1-10 C p. 93-104
 artikel
2330 Metric dimension and metric independence number of incidence graphs of symmetric designs Tang, Lang
1-10 C p. 43-50
 artikel
2331 Metric dimension and pattern avoidance in graphs Geneson, Jesse
1-10 C p. 1-7
 artikel
2332 Metric dimension: From graphs to oriented graphs Bensmail, Julien
1-10 C p. 28-42
 artikel
2333 Metric k -median clustering in insertion-only streams Braverman, Vladimir
1-10 C p. 164-180
 artikel
2334 Metric properties of generalized Sierpiński graphs over stars Alizadeh, Yaser
 2019
 1-10 C p. 48-55
 artikel
2335 Metric properties of Sierpiński triangle graphs Hinz, Andreas M.
1-10 C p. 439-453
 artikel
2336 Metric spaces in which many triangles are degenerate Chvátal, Vašek
1-10 C p. 97-99
 artikel
2337 Mim-Width I. Induced path problems Jaffke, Lars
1-10 C p. 153-168
 artikel
2338 Minimal arc-sets spanning dicycles Cornaz, D.
 2018
 1-10 C p. 33-43
 artikel
2339 Minimal balanced collections and their application to core stability and other topics of game theory Laplace Mermoud, Dylan
1-10 C p. 60-81
 artikel
2340 Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs Atminas, A.
1-10 C p. 57-69
 artikel
2341 Minimal graphs for 2-factor extension Costa, M.-C.
1-10 C p. 65-79
 artikel
2342 Minimal graphs for matching extensions Costa, M.-C.
 2018
 1-10 C p. 47-55
 artikel
2343 Minimal NMR distance information for rigidity of protein graphs Lavor, Carlile
 2019
 1-10 C p. 91-104
 artikel
2344 Minimal obstructions for a matrix partition problem in chordal graphs García-Altamirano, Juan Carlos
1-10 C p. 58-66
 artikel
2345 Minimal obstructions to 2-polar cographs Hell, Pavol
 2019
 1-10 C p. 219-228
 artikel
2346 Minimal obstructions to ( s , 1 ) -polarity in cographs Contreras-Mendoza, Fernando Esteban
1-10 C p. 111-117
 artikel
2347 Minimal proper non-IRUP instances of the one-dimensional cutting stock problem Kartak, Vadim M.
 2015
 1-10 C p. 120-129
10 p.
 artikel
2348 Minimal spread of integral circulant graphs Bašić, Milan
1-10 C p. 317-333
 artikel
2349 Minimal trees with respect to exponential Zagreb indices Dehgardi, Nasrin
1-10 C p. 11-17
 artikel
2350 Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods Nguyen, Trung Thanh
 2014
 1-10 C p. 54-68
15 p.
 artikel
2351 Minimizing ESCT forms for two-variable multiple-valued input binary output functions Mizuki, Takaaki
 2014
 1-10 C p. 186-194
9 p.
 artikel
2352 Minimizing maximum weight of subsets of a maximum matching in a bipartite graph Barketau, Maksim
 2015
 1-10 C p. 4-19
16 p.
 artikel
2353 Minimizing the number of apertures in multileaf collimator sequencing with field splitting Baatar, Davaatseren
 2018
 1-10 C p. 87-103
 artikel
2354 Minimum augmented Zagreb index of c -cyclic graphs Liu, Muhuo
1-10 C p. 32-38
 artikel
2355 Minimum broadcast digraphs Liestman, Arthur L
 1992
 1-10 C p. 401-419
19 p.
 artikel
2356 Minimum consistent subset of simple graph classes Dey, Sanjana
1-10 C p. 255-277
 artikel
2357 Minimum-cost diagnostic strategies for k -out-of- n systems with imperfect tests Wei, Wenchao
 2017
 1-10 C p. 185-196
12 p.
 artikel
2358 Minimum cost noncrossing flow problem on layered networks Altınel, İ. Kuban
 2019
 1-10 C p. 2-21
 artikel
2359 Minimum degree conditions for the strength and bandwidth of graphs Ichishima, Rikio
1-10 C p. 191-198
 artikel
2360 Minimum degree distance among cacti with perfect matchings Zhu, Zhongxun
 2016
 1-10 C p. 191-201
11 p.
 artikel
2361 Minimum degree, independence number and pseudo [ 2 , b ] -factors in graphs Bekkai, Siham
 2014
 1-10 C p. 108-114
7 p.
 artikel
2362 Minimum 2-dominating sets in regular graphs Hoppen, Carlos
1-10 C p. 268-285
 artikel
2363 Minimum equivalent precedence relation systems Sou, Kin Cheong
 2017
 1-10 C p. 195-214
20 p.
 artikel
2364 Minimum general sum-connectivity index of trees and unicyclic graphs having a given matching number Jamil, Muhammad Kamran
 2017
 1-10 C p. 143-150
8 p.
 artikel
2365 Minimum k -critical bipartite graphs Cichacz, Sylwia
1-10 C p. 54-66
 artikel
2366 Minimum length word-representants of graph products Srinivasan, Eshwar
1-10 C p. 91-104
 artikel
2367 Minimum length word-representants of word-representable graphs Srinivasan, Eshwar
1-10 C p. 149-158
 artikel
2368 Minimum maximal acyclic matching in proper interval graphs Chaudhary, Juhi
1-10 C p. 414-427
 artikel
2369 Minimum multiplicity edge coloring via orientation Bampas, Evangelos
1-10 C p. 380-388
 artikel
2370 Minimum number of affine simplices of given dimension Szalkai, István
 2015
 1-10 C p. 141-149
9 p.
 artikel
2371 Minimum number of maximal dissociation sets in trees Zhang, Junxia
1-10 C p. 272-278
 artikel
2372 Minimum self-dual decompositions of positive dual-minor Boolean functions Bioch, Jan C.
 1999
 1-10 C p. 307-326
20 p.
 artikel
2373 Minimum size tree-decompositions Li, Bi
 2018
 1-10 C p. 109-127
 artikel
2374 Minimum Spanning Tree Cycle Intersection problem Dubinsky, Manuel
1-10 C p. 152-166
 artikel
2375 Minimum spanning tree cycle intersection problem on outerplanar graphs Su, Tai-Yu
1-10 C p. 328-339
 artikel
2376 Minimum strictly fundamental cycle bases of planar graphs are hard to find Reich, Alexander
 2016
 1-10 C p. 150-159
10 p.
 artikel
2377 Minimum sum coloring problem: Upper bounds for the chromatic strength Lecat, Clément
 2017
 1-10 C p. 71-82
12 p.
 artikel
2378 Minimum t P 3 -saturation graphs He, Zhen
1-10 C p. 148-156
 artikel
2379 Minimum values of the second largest Q -eigenvalue Aouchiche, Mustapha
1-10 C p. 46-51
 artikel
2380 Minimum Wiener index of triangulations and quadrangulations Czabarka, Éva
1-10 C p. 295-310
 artikel
2381 Mining approximate patterns with frequent locally optimal occurrences Nakamura, Atsuyoshi
 2016
 1-10 C p. 123-152
30 p.
 artikel
2382 Min–max–min robustness for combinatorial problems with discrete budgeted uncertainty Goerigk, Marc
1-10 C p. 707-725
 artikel
2383 Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks Bhattacharya, Binay
 2015
 1-10 C p. 18-30
13 p.
 artikel
2384 Minmax regret for sink location on dynamic flow paths with general capacities Golin, Mordecai
1-10 C p. 1-26
 artikel
2385 Minor-obstructions for apex sub-unicyclic graphs Leivaditis, Alexandros
1-10 C p. 538-555
 artikel
2386 Minor relation for quadrangulations on the projective plane Matsumoto, Naoki
 2016
 1-10 C p. 296-302
7 p.
 artikel
2387 Minor stars in plane graphs with minimum degree five Li, Yangfan
 2019
 1-10 C p. 233-242
 artikel
2388 Misère Nim with multi-player Liu, Wen An
 2017
 1-10 C p. 40-50
11 p.
 artikel
2389 Mixed covering arrays on 3-uniform hypergraphs Akhtar, Yasmeen
 2017
 1-10 C p. 8-22
 artikel
2390 Mixed integer formulations using natural variables for single machine scheduling around a common due date Falq, Anne-Elisabeth
1-10 C p. 36-59
 artikel
2391 Mixed integer linear programming for feature selection in support vector machine Labbé, Martine
 2019
 1-10 C p. 276-304
 artikel
2392 Mixed logical-linear programming Hooker, J.N.
 1999
 1-10 C p. 395-442
48 p.
 artikel
2393 Mixed metric dimension of graphs with edge disjoint cycles Sedlar, Jelena
1-10 C p. 1-8
 artikel
2394 Mixing time of the switch Markov chain and stable degree sequences Gao, Pu
1-10 C p. 143-162
 artikel
2395 Models and algorithms for the Weighted Safe Set Problem Malaguti, Enrico
1-10 C p. 23-34
 artikel
2396 Moderately exponential time algorithms for the maximum bounded-degree-1 set problem Chang, Maw-Shang
 2018
 1-10 C p. 114-125
 artikel
2397 Modified hyper-Wiener index of trees Bozkurt Altındağ, Ş.B.
1-10 C p. 101-109
 artikel
2398 Modular decomposition of graphs and the distance preserving property Zahedi, Emad
 2019
 1-10 C p. 192-198
 artikel
2399 Modulo 5-orientations and degree sequences Han, Miaomiao
 2019
 1-10 C p. 155-163
 artikel
2400 Modulo orientations with bounded independence number Han, Miaomiao
1-10 C p. 14-22
 artikel
2401 Monitoring edge-geodetic sets: Hardness and graph products Haslegrave, John
1-10 C p. 79-84
 artikel
2402 Monitoring the edges of a graph using distances Foucaud, Florent
1-10 C p. 424-438
 artikel
2403 Monochromatic disconnection of graphs Li, Ping
1-10 C p. 171-179
 artikel
2404 Monochromatic graph decompositions inspired by anti-Ramsey colorings Caro, Yair
1-10 C p. 190-200
 artikel
2405 Monochromatic k -connection of graphs Cai, Qingqiong
1-10 C p. 328-341
 artikel
2406 Monopolar graphs: Complexity of computing classical graph parameters Barbato, Michele
1-10 C p. 277-285
 artikel
2407 Monotone bargaining is Nash-solvable Gurvich, Vladimir
 2018
 1-10 C p. 1-15
 artikel
2408 More on the complexity of defensive domination in graphs Henning, Michael A.
1-10 C p. 167-179
 artikel
2409 More on the one-dimensional sliding-coin puzzle Lin, Ting-Yu
 2014
 1-10 C p. 32-41
10 p.
 artikel
2410 More results on the z -chromatic number of graphs Khaleghi, Abbas
1-10 C p. 89-99
 artikel
2411 Multicolor bipartite Ramsey numbers of K t , s and large K n , n Wang, Xiuwen
 2016
 1-10 C p. 238-242
5 p.
 artikel
2412 Multicolor induced Ramsey numbers Song, Yanyan
1-10 C p. 269-280
 artikel
2413 Multilevel clustering models and interval convexities Bertrand, Patrice
 2017
 1-10 C p. 54-66
13 p.
 artikel
2414 Multilevel secret sharing schemes arising from the normal rational curve Caputo, Stefania
1-10 C p. 158-165
 artikel
2415 0-1 multilinear programming as a unifying theory for LAD pattern generation Yan, Kedong
 2017
 1-10 C p. 21-39
19 p.
 artikel
2416 Multilinear sets with two monomials and cardinality constraints Chen, Rui
1-10 C p. 67-79
 artikel
2417 Multi-objective matroid optimization with ordinal weights Klamroth, Kathrin
1-10 C p. 104-119
 artikel
2418 Multi-player Small Nim with Passes Liu, Wen An
 2018
 1-10 C p. 306-314
 artikel
2419 Multi-player Wythoff’s game and its variants Liu, Wen An
 2017
 1-10 C p. 1-16
16 p.
 artikel
2420 Multiplicative version of eccentric connectivity index Azari, Mahdieh
1-10 C p. 32-42
 artikel
2421 Multiplicative Zagreb indices of k -trees Wang, Shaohui
 2015
 1-10 C p. 168-175
8 p.
 artikel
2422 Multiplicity of eigenvalues of cographs Allem, Luiz Emilio
1-10 C p. 43-52
 artikel
2423 Multiplicity of signless Laplacian eigenvalue 2 of a connected graph with a perfect matching Zhao, Jinxing
1-10 C p. 480-486
 artikel
2424 Multiprofessor scheduling Dosa, Gyorgy
 2018
 1-10 C p. 195-209
 artikel
2425 Multi-symbol forbidden configurations Ellis, Keaton
1-10 C p. 24-36
 artikel
2426 Multitasking via alternate and shared processing: Algorithms and complexity Hall, Nicholas G.
 2016
 1-10 C p. 41-58
18 p.
 artikel
2427 Multithread interval scheduling with flexible machine availabilities: Complexity and efficient algorithms Anapolska, Mariia
1-10 C p. 230-253
 artikel
2428 Multi-way sparsest cut problem on trees with a control on the number of parts and outliers Javadi, Ramin
1-10 C p. 281-291
 artikel
2429 Multi-word-representability of graphs Kenkireth, Benny George
1-10 C p. 61-74
 artikel
2430 Mutual transferability for ( F , B , R ) -domination on strongly chordal graphs and cactus graphs Chu, Kuan-Ting
 2019
 1-10 C p. 41-52
 artikel
2431 Mutual-visibility in strong products of graphs via total mutual-visibility Cicerone, Serafino
1-10 C p. 136-146
 artikel
2432 Navigating between packings of graphic sequences Erdős, Péter L.
 2019
 1-10 C p. 252-258
 artikel
2433 Near-interval edge colorings of graphs Casselgren, Carl Johan
1-10 C p. 23-36
 artikel
2434 Near-linear-time algorithm for the geodetic Radon number of grids Dourado, Mitre Costa
 2016
 1-10 C p. 277-283
 artikel
2435 Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs Gu, Qian-Ping
 2019
 1-10 C p. 186-205
 artikel
2436 Nearly equal distances in metric spaces Ophir, Amit
 2014
 1-10 C p. 122-127
6 p.
 artikel
2437 Nearly optimal codebooks based on generalized Jacobi sums Heng, Ziling
 2018
 1-10 C p. 227-240
 artikel
2438 Near-optimal induced universal graphs for cycles and paths Abrahamsen, Mikkel
1-10 C p. 1-13
 artikel
2439 Negative local feedbacks in Boolean networks Ruet, Paul
 2017
 1-10 C p. 1-17
17 p.
 artikel
2440 Neighbor connectivity of pancake graphs and burnt pancake graphs Gu, Mei-Mei
1-10 C p. 46-57
 artikel
2441 Neighbor-distinguishing indices of planar graphs with maximum degree ten Huang, Danjun
1-10 C p. 49-60
 artikel
2442 Neighborhood inclusion posets and tree representations for chordal and dually chordal graphs De Caria, Pablo
1-10 C p. 151-161
 artikel
2443 Neighborhood-restricted [ ≤ 2 ] -achromatic colorings Chandler, James D.
 2016
 1-10 C p. 39-44
6 p.
 artikel
2444 Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree Dong, Aijun
 2014
 1-10 C p. 84-90
7 p.
 artikel
2445 Neighbor sum distinguishing edge colorings of sparse graphs Hu, Xiaolan
 2015
 1-10 C p. 119-125
7 p.
 artikel
2446 Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles Sun, Lin
1-10 C p. 146-153
 artikel
2447 Neighbor sum distinguishing total choosability of planar graphs without 4-cycles Wang, Jihui
 2016
 1-10 C p. 215-219
5 p.
 artikel
2448 Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles Duan, Yuan-yuan
1-10 C p. 473-479
 artikel
2449 Neighbor sum distinguishing total chromatic number of 2-degenerate graphs Xu, Changqing
 2018
 1-10 C p. 349-352
 artikel
2450 Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring Lu, You
 2018
 1-10 C p. 109-115
 artikel
2451 Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions Song, Chao
1-10 C p. 202-209
 artikel
2452 Neighbor sum distinguishing total coloring of sparse IC-planar graphs Song, Wen-yao
 2018
 1-10 C p. 183-192
 artikel
2453 Neighbor sum distinguishing total colorings of planar graphs with maximum degree Δ Cheng, Xiaohan
 2015
 1-10 C p. 34-41
8 p.
 artikel
2454 Neighbour-sum-2-distinguishing edge-weightings: Doubling the 1–2–3 Conjecture Baudon, Olivier
 2018
 1-10 C p. 83-92
 artikel
2455 Neighbour sum distinguishing edge-weightings with local constraints Dailly, Antoine
1-10 C p. 109-124
 artikel
2456 Neighbour sum distinguishing total colourings via the Combinatorial Nullstellensatz Przybyło, Jakub
 2016
 1-10 C p. 163-173
11 p.
 artikel
2457 Net Laplacian controllability for joins of signed graphs Stanić, Zoran
1-10 C p. 197-203
 artikel
2458 Network decontamination under m -immunity Flocchini, Paola
 2016
 1-10 C p. 114-129
16 p.
 artikel
2459 Network disconnection games: A game theoretic approach to checkpoint evaluation in networks Baïou, Mourad
1-10 C p. 198-208
 artikel
2460 New algorithms and bounds for halving pseudolines Bereg, Sergey
1-10 C p. 194-206
 artikel
2461 New bounds for perfect k -hashing Costa, Simone
1-10 C p. 374-382
 artikel
2462 New bounds for Ramsey numbers R ( K k − e , K l − e ) Goedgebeur, Jan
1-10 C p. 212-221
 artikel
2463 New bounds for the b-chromatic number of vertex deleted graphs Del-Vecchio, Renata R.
1-10 C p. 108-113
 artikel
2464 New bounds for the probability that at least k -out-of- n events occur with unimodal distributions Subasi, Munevver M.
 2017
 1-10 C p. 138-157
20 p.
 artikel
2465 New bounds of degree-based topological indices for some classes of c -cyclic graphs Bianchi, Monica
 2015
 1-10 C p. 62-75
14 p.
 artikel
2466 New bounds on clique-chromatic numbers of Johnson graphs Raigorodskii, A.M.
1-10 C p. 724-729
 artikel
2467 New bounds on the double domination number of trees Cabrera-Martínez, Abel
1-10 C p. 97-103
 artikel
2468 New characterizations and a concept of potential for each multinomial (probabilistic) value Domènech, Margarita
1-10 C p. 56-67
 artikel
2469 New classes of clustering coefficient locally maximizing graphs Fukami, Tatsuya
 2014
 1-10 C p. 202-213
12 p.
 artikel
2470 New classes of Facets for complementarity knapsack problems Del Pia, Alberto
1-10 C p. 247-262
 artikel
2471 New combinatorial interpretations of r -Whitney and r -Whitney–Lah numbers Gyimesi, Eszter
 2019
 1-10 C p. 222-233
 artikel
2472 New comments on “A Hamilton sufficient condition for completely independent spanning tree” Li, Junjiang
1-10 C p. 10-15
 artikel
2473 New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints Györgyi, Péter
1-10 C p. 97-109
 artikel
2474 New compression schemes for natural number sequences Asraf, S.
1-10 C p. 18-27
 artikel
2475 New constant dimension subspace codes from improved parallel subcode construction Hong, Xiaoqin
1-10 C p. 142-148
 artikel
2476 New constructions of balanced Boolean functions with the maximum possible Walsh supports Lou, Yueying
1-10 C p. 262-267
 artikel
2477 New (Δ, D) graphs discovered by heuristic search Allwright, James
 1992
 1-10 C p. 3-8
6 p.
 artikel
2478 New exact approaches and approximation results for the Penalized Knapsack Problem Della Croce, Federico
 2019
 1-10 C p. 122-135
 artikel
2479 New extremal binary self-dual codes from a Baumert–Hall array Kaya, Abidin
 2019
 1-10 C p. 74-83
 artikel
2480 New inequalities for network distance measures by using graph spectra Dehmer, Matthias
 2019
 1-10 C p. 17-27
 artikel
2481 New lower bounds for the first variable Zagreb index Martínez-Pérez, Alvaro
1-10 C p. 166-173
 artikel
2482 New lower bounds for Tverberg partitions with tolerance in the plane Bereg, Sergey
1-10 C p. 596-603
 artikel
2483 New methods for using Cayley graphs in interconnection networks Cooperman, Gene
 1992
 1-10 C p. 95-118
24 p.
 artikel
2484 New orthogonality criterion for shortest vector of lattices and its applications Lee, Hyang-Sook
1-10 C p. 323-335
 artikel
2485 New potential functions for greedy independence and coloring Borowiecki, Piotr
 2015
 1-10 C p. 61-72
12 p.
 artikel
2486 New progress in combinatorial optimization Chen, Bo
1-10 C p. 68-70
 artikel
2487 New results for the Mondrian art problem Dalfó, C.
1-10 C p. 64-73
 artikel
2488 New results on edge-coloring and total-coloring of split graphs Couto, Fernanda
1-10 C p. 297-306
 artikel
2489 New results on ptolemaic graphs Markenzon, Lilian
 2015
 1-10 C p. 135-140
6 p.
 artikel
2490 New results on radio k -labelings of distance graphs Korže, Danilo
1-10 C p. 472-479
 artikel
2491 New Steiner 2-designs from old ones by paramodifications Mezőfi, Dávid
1-10 C p. 114-122
 artikel
2492 New sufficient conditions for strong unimodality of multivariate discrete distributions Alharbi, Majed Ghazi
 2018
 1-10 C p. 1-25
 artikel
2493 New tabulation and sparse dynamic programming based techniques for sequence similarity problems Grabowski, Szymon
 2016
 1-10 C p. 96-103
8 p.
 artikel
2494 New theoretical results on the Monotone Boolean Duality and the Monotone Boolean Dualization problems Raffaele, Alice
1-10 C p. 347-369
 artikel
2495 New transience bounds for max-plus linear systems Charron-Bost, Bernadette
 2017
 1-10 C p. 83-99
17 p.
 artikel
2496 New transmission irregular chemical graphs Xu, Kexiang
1-10 C p. 286-295
 artikel
2497 New variants of perfect non-crossing matchings Mantas, Ioannis
1-10 C p. 1-14
 artikel
2498 NIC-planar graphs Bachmaier, Christian
 2017
 1-10 C p. 23-40
 artikel
2499 Nilpotent dynamics on signed interaction graphs and weak converses of Thomas’ rules Richard, Adrien
 2019
 1-10 C p. 160-175
 artikel
2500 Nim with one or two dynamic restrictions Liu, Wen An
 2016
 1-10 C p. 48-64
17 p.
 artikel
2501 Nine classes of permutations enumerated by binomial transform of Fine’s sequence Mansour, Toufik
 2017
 1-10 C p. 94-105
12 p.
 artikel
2502 ( n , m ) -graphs with maximum exponential second Zagreb index Buyantogtokh, Lkhagva
1-10 C p. 350-354
 artikel
2503 Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design Akhavan Kazemzadeh, Mohammad Rahim
1-10 C p. 255-275
 artikel
2504 No graph with nullity η ( G ) = | V ( G ) | − 2 m ( G ) + 2 c ( G ) − 1 Li, Xin
 2019
 1-10 C p. 130-136
 artikel
2505 Nonblocking self-routing switching networks Hollman, H.D.L.
 1992
 1-10 C p. 319-340
22 p.
 artikel
2506 Non covered vertices in Fibonacci cubes by a maximum set of disjoint hypercubes Mollard, Michel
 2017
 1-10 C p. 219-221
3 p.
 artikel
2507 Non-crossing shortest paths lengths in planar graphs in linear time Balzotti, Lorenzo
1-10 C p. 183-191
 artikel
2508 Non-edge orientation and vertex ordering characterizations of some classes of bigraphs Huang, Jing
 2018
 1-10 C p. 190-193
 artikel
2509 Nonempty intersection of longest paths in graphs without forbidden pairs Gao, Yuping
1-10 C p. 76-83
 artikel
2510 Nonexistence of efficient dominating sets in the Cayley graphs generated by transposition trees of diameter 3 Dejter, Italo J.
 2017
 1-10 C p. 116-124
 artikel
2511 Non-existence results for vectorial bent functions with Dillon exponent Lapierre, Lucien
1-10 C p. 71-74
 artikel
2512 Non-hamiltonian 1-tough triangulations with disjoint separating triangles Fujisawa, Jun
1-10 C p. 622-625
 artikel
2513 Non-inclusion and other subclasses of chordal graphs Markenzon, Lilian
1-10 C p. 43-47
 artikel
2514 Non-inclusive diagnosability of folded hypercube-like networks Zhuo, Nengjin
1-10 C p. 237-246
 artikel
2515 Nonograms: Combinatorial questions and algorithms Berend, Daniel
 2014
 1-10 C p. 30-42
13 p.
 artikel
2516 Non-overlapping descents and ascents in stack-sortable permutations Kitaev, Sergey
1-10 C p. 112-119
 artikel
2517 Non-Singular graphs with a Singular Deck Farrugia, Alexander
 2016
 1-10 C p. 50-57
8 p.
 artikel
2518 Non total-unimodularity neutralized simplicial complexes Krishnamoorthy, Bala
 2018
 1-10 C p. 44-62
 artikel
2519 Non-trivial t -intersecting separated families Frankl, Peter
1-10 C p. 124-137
 artikel
2520 Nordhaus–Gaddum decompositions for group coloring and DP coloring Bickle, Allan
1-10 C p. 264-269
 artikel
2521 Nordhaus–Gaddum problems for power domination Benson, Katherine F.
 2018
 1-10 C p. 103-113
 artikel
2522 Nordhaus–Gaddum type inequalities for the two largest Laplacian eigenvalues Grijó, Rodrigo
 2019
 1-10 C p. 176-183
 artikel
2523 Nordhaus–Gaddum type inequality for the fractional matching number of a graph Yang, Ting
1-10 C p. 59-67
 artikel
2524 Nordhaus–Gaddum type inequality for the integer k-matching number of a graph Chen, Qian-Qian
1-10 C p. 21-31
 artikel
2525 Nordhaus–Gaddum-type problems for lines in hypergraphs Chen, Xiaomin
 2016
 1-10 C p. 297-302
6 p.
 artikel
2526 Nordhaus–Gaddum-type relations of three graph coloring parameters Huang, Kuo-Ching
 2014
 1-10 C p. 404-408
5 p.
 artikel
2527 Nordhaus–Gaddum-type results for monitoring edge-geodetic number of graphs Zhang, Yingying
1-10 C p. 39-52
 artikel
2528 Nordhaus–Gaddum-type results for the generalized edge-connectivity of graphs Li, Xueliang
 2015
 1-10 C p. 102-112
11 p.
 artikel
2529 Nordhaus–Gaddum-type results for the Steiner Wiener index of graphs Mao, Yaping
 2017
 1-10 C p. 167-175
9 p.
 artikel
2530 Normal 6-edge-colorings of some bridgeless cubic graphs Mazzuoccolo, Giuseppe
1-10 C p. 252-262
 artikel
2531 Normalized Laplacian spectrum of complete multipartite graphs Sun, Shaowei
1-10 C p. 234-245
 artikel
2532 Note on a zero net-regular signed graph Ren, Xiangyu
1-10 C p. 28-32
 artikel
2533 Note on E -super vertex magic graphs Wang, Tao-Ming
 2014
 1-10 C p. 160-162
3 p.
 artikel
2534 Note on fair game edge-connectivity of graphs Furuya, Michitaka
1-10 C p. 132-135
 artikel
2535 Note on injective edge-coloring of graphs Miao, Zhengke
1-10 C p. 65-74
 artikel
2536 Note on non-uniform bin packing games Kern, Walter
 2014
 1-10 C p. 175-184
10 p.
 artikel
2537 Note on Sombor index of connected graphs with given degree sequence Wei, Peichao
1-10 C p. 51-55
 artikel
2538 Note on the bisection width of cubic graphs Jobson, Adam S.
1-10 C p. 434-442
 artikel
2539 Note on the eccentricity spectral radius of uniform hypertrees with given diameter Tang, Zikai
1-10 C p. 214-216
 artikel
2540 Note on the multiplicative Zagreb indices Kazemi, Ramin
 2016
 1-10 C p. 147-154
8 p.
 artikel
2541 Note on the upper bound of the rainbow index of a graph Cai, Qingqiong
 2016
 1-10 C p. 68-74
7 p.
 artikel
2542 Notes on Boolean read- k and multilinear circuits Jukna, Stasys
1-10 C p. 307-327
 artikel
2543 [No title] Faigle, Ulrich
 2014
 1-10 C p. 1-
1 p.
 artikel
2544 Novel bilevel formulations for waste management Caramia, Massimiliano
1-10 C p. 181-198
 artikel
2545 Novshek’s trick as a polynomial algorithm Kukushkin, Nikolai S.
 2014
 1-10 C p. 28-31
4 p.
 artikel
2546 Nowhere-zero flow on some products of signed graphs Maimani, Hamid Reza
 2019
 1-10 C p. 84-92
 artikel
2547 ( N , p ) -equitable b-coloring of graphs Ait Taleb, Samiha
 2018
 1-10 C p. 1-15
 artikel
2548 Null and non-rainbow colorings of projective plane and sphere triangulations Arocha, Jorge L.
 2016
 1-10 C p. 195-199
 artikel
2549 Null decomposition of unicyclic graphs Allem, L. Emilio
1-10 C p. 594-611
 artikel
2550 Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices Ma, Xiaobin
 2016
 1-10 C p. 171-176
6 p.
 artikel
2551 Number of lines in hypergraphs Aboulker, Pierre
 2014
 1-10 C p. 137-140
4 p.
 artikel
2552 Numerical semigroups of Szemerédi type Adhikari, S.D.
 2019
 1-10 C p. 8-13
 artikel
2553 Obituary: Peter C. Fishburn (1936–2021) Brams, Steven J.
1-10 C p. 109-110
 artikel
2554 Obstructions for linear rank-width at most 1 Adler, Isolde
 2014
 1-10 C p. 3-13
11 p.
 artikel
2555 Obstructions for partitioning into forests and outerplanar graphs Kim, Ringi
1-10 C p. 15-28
 artikel
2556 Odd-sum colorings of planar graphs Cranston, Daniel W.
1-10 C p. 82-88
 artikel
2557 Old and new results on packing arborescences in directed hypergraphs Fortier, Quentin
 2018
 1-10 C p. 26-33
 artikel
2558 On a base exchange game on bispanning graphs Andres, Stephan Dominique
 2014
 1-10 C p. 25-36
12 p.
 artikel
2559 On a certain class of power- and energy-related scheduling problems Różycki, Rafał
 2019
 1-10 C p. 167-187
 artikel
2560 On a class of graphs between threshold and total domishold graphs Chiarelli, Nina
 2015
 1-10 C p. 43-58
16 p.
 artikel
2561 On a class of m -to-1 functions Ding, Zhiguo
1-10 C p. 208-210
 artikel
2562 On a combinatorial problem in botanical epidemiology Mansour, Toufik
 2016
 1-10 C p. 131-150
20 p.
 artikel
2563 On a conjecture for the university timetabling problem Kubiak, Wiesław
1-10 C p. 26-49
 artikel
2564 On a conjecture involving a bound for the total restrained domination number of a graph Joubert, Ernst J.
 2019
 1-10 C p. 177-187
 artikel
2565 On a conjecture of Eǧecioǧlu and Iršič Wei, Jianxin
1-10 C p. 92-105
 artikel
2566 On a conjecture of Schweser and Stiebitz Liu, Muhuo
1-10 C p. 25-31
 artikel
2567 On a conjecture of TxGraffiti: Relating zero forcing and vertex covers in graphs Brimkov, Boris
1-10 C p. 290-302
 artikel
2568 On a conjecture on the order of cages with a given girth pair Balbuena, C.
 2015
 1-10 C p. 24-33
10 p.
 artikel
2569 On a Diagonal Conjecture for classical Ramsey numbers Liang, Meilian
 2019
 1-10 C p. 195-200
 artikel
2570 On a distance-constrained graph labeling to model cooperation Georges, J.P.
1-10 C p. 17-31
 artikel
2571 On a family of trees with minimal atom-bond connectivity index Du, Zhibin
 2016
 1-10 C p. 37-49
13 p.
 artikel
2572 On a family of universal cycles for multi-dimensional permutations Kitaev, Sergey
1-10 C p. 310-320
 artikel
2573 On a four-parameter generalization of some special sequences da Silva, Robson
 2018
 1-10 C p. 154-171
 artikel
2574 On a generalization of extended resolution Kullmann, O.
 1999
 1-10 C p. 149-176
28 p.
 artikel
2575 On algorithmic complexity of double Roman domination Poureidi, Abolfazl
1-10 C p. 539-551
 artikel
2576 On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs Yang, Yu
 2016
 1-10 C p. 184-203
20 p.
 artikel
2577 On almost bipartite non-König–Egerváry graphs Levit, Vadim E.
1-10 C p. 127-134
 artikel
2578 On a new cyclicity measure of graphs—The global cyclicity index Yang, Yujun
 2014
 1-10 C p. 88-97
10 p.
 artikel
2579 On an extremal hypergraph problem related to combinatorial batch codes Balachandran, Niranjan
 2014
 1-10 C p. 373-380
8 p.
 artikel
2580 On an inequality between pseudorandom measures of lattices Gyarmati, Katalin
1-10 C p. 9-18
 artikel
2581 On approximability of minimum color-spanning ball in high dimensions Kazemi, Mohammad Reza
1-10 C p. 188-191
 artikel
2582 On approximate enhanced covers under Hamming distance Guth, Ondřej
1-10 C p. 67-80
 artikel
2583 On approximating the Incremental Knapsack Problem Della Croce, Federico
 2019
 1-10 C p. 26-42
 artikel
2584 On a relation between k -path partition and k -path vertex cover Brause, Christoph
 2017
 1-10 C p. 28-38
11 p.
 artikel
2585 On a relation between the atom-bond connectivity and the first geometric–arithmetic indices Zhong, Lingping
 2015
 1-10 C p. 249-253
5 p.
 artikel
2586 On arithmetically progressed suffix arrays and related Burrows–Wheeler transforms Daykin, Jacqueline W.
1-10 C p. 180-199
 artikel
2587 On arithmetic sums of Cantor-type sequences of integers Hegyvári, Norbert
1-10 C p. 1-3
 artikel
2588 On asymptotic packing of geometric graphs Cranston, Daniel W.
1-10 C p. 142-152
 artikel
2589 On a variant of Flory model Došlić, Tomislav
1-10 C p. 269-292
 artikel
2590 On average distance in tournaments and Eulerian digraphs Dankelmann, Peter
 2019
 1-10 C p. 38-47
 artikel
2591 On average sizes and enumeration of minimal edge covers Engbers, John
1-10 C p. 148-164
 artikel
2592 On basic chordal graphs and some of its subclasses De Caria, Pablo
 2016
 1-10 C p. 261-276
 artikel
2593 On b -coloring of powers of hypercubes Francis, P.
 2017
 1-10 C p. 74-86
13 p.
 artikel
2594 On b-greedy colourings and z-colourings Costa Ferreira da Silva, Jonas
1-10 C p. 250-268
 artikel
2595 On bicliques and the second clique graph of suspensions Pizaña, M.A.
1-10 C p. 261-267
 artikel
2596 On bipartization of cubic graphs by removal of an independent set Furmańczyk, Hanna
 2016
 1-10 C p. 115-121
7 p.
 artikel
2597 On blockers and transversals of maximum independent sets in co-comparability graphs Lucke, Felicia
1-10 C p. 307-321
 artikel
2598 On bounding the difference between the maximum degree and the chromatic number by a constant Weil, Vera
 2017
 1-10 C p. 228-234
7 p.
 artikel
2599 On broadcasting time in the model of travelling agents Huq, Reaz
1-10 C p. 246-263
 artikel
2600 On card guessing game with one time riffle shuffle and complete feedback Liu, Pengda
1-10 C p. 270-278
 artikel
2601 On Cartesian products of signed graphs Lajou, Dimitri
1-10 C p. 533-555
 artikel
2602 On CD-chromatic number and its lower bound in some classes of graphs M.A., Shalu
1-10 C p. 202-210
 artikel
2603 On certain trees with the same degree sequence Fernandes, Rosário
1-10 C p. 138-146
 artikel
2604 On characterizing the class of cographic signed-graphic matroids Papalamprou, Konstantinos
1-10 C p. 90-102
 artikel
2605 On characterizing the critical graphs for matching Ramsey numbers Xu, Chuandong
1-10 C p. 15-20
 artikel
2606 On ( 3 , 1 ) ∗ -choosability of planar graphs without adjacent short cycles Chen, Min
 2014
 1-10 C p. 159-166
8 p.
 artikel
2607 On chordal and perfect plane near-triangulations Salam, Sameera M.
1-10 C p. 53-60
 artikel
2608 On chordal graph and line graph squares Scheidweiler, Robert
 2018
 1-10 C p. 239-247
 artikel
2609 On chordal phylogeny graphs Eoh, Soogang
1-10 C p. 80-91
 artikel
2610 On claw-free graphs with all but four eigenvalues equal to 0 or − 1 Sun, Shaowei
1-10 C p. 71-84
 artikel
2611 On clique coverings of complete multipartite graphs Davoodi, Akbar
1-10 C p. 19-23
 artikel
2612 On clique numbers of colored mixed graphs Chakraborty, Dipayan
1-10 C p. 29-40
 artikel
2613 On closure operators related to maximal tricliques in tripartite hypergraphs Ignatov, Dmitry I.
 2018
 1-10 C p. 74-84
 artikel
2614 On coloring a class of claw-free and hole-twin-free graphs Dai, Yingjun
1-10 C p. 162-170
 artikel
2615 On colorings of the Boolean lattice avoiding a rainbow copy of a poset Patkós, Balázs
1-10 C p. 108-114
 artikel
2616 On coloring the arcs of biregular graphs Dejter, Italo J.
1-10 C p. 489-498
 artikel
2617 On colouring point visibility graphs Diwan, Ajit Arvind
1-10 C p. 78-90
 artikel
2618 On comparing algorithms for the maximum clique problem Züge, Alexandre Prusch
1-10 C p. 1-13
 artikel
2619 On compatibility and incompatibility of collections of unrooted phylogenetic trees Fernández-Baca, David
 2018
 1-10 C p. 42-58
 artikel
2620 On 3-component domination numbers in graphs Gao, Zhipeng
1-10 C p. 53-62
 artikel
2621 On computing the Galois lattice of bipartite distance hereditary graphs Apollonio, Nicola
 2017
 1-10 C p. 1-9
9 p.
 artikel
2622 On computing the 2-vertex-connected components of directed graphs Jaberi, Raed
 2016
 1-10 C p. 164-172
9 p.
 artikel
2623 On conflict-free connection of graphs Chang, Hong
 2019
 1-10 C p. 167-182
 artikel
2624 On conjecture of Merrifield–Simmons index Das, Kinkar Chandra
1-10 C p. 211-217
 artikel
2625 On conjectures of network distance measures by using graph spectra Ilić, Aleksandar
1-10 C p. 248-255
 artikel
2626 On connected Boolean functions Ekin, Oya
 1999
 1-10 C p. 337-362
26 p.
 artikel
2627 On connectivities of edge-colored graphs Yoshimoto, Kiyoshi
1-10 C p. 87-92
 artikel
2628 On constructing complete permutation polynomials over finite fields of even characteristic Wu, Baofeng
 2015
 1-10 C p. 213-222
10 p.
 artikel
2629 On constructing rational spanning tree edge densities Kahl, Nathan
 2016
 1-10 C p. 224-232
9 p.
 artikel
2630 On convergence of scatter search and star paths with directional rounding for 0–1 mixed integer programs Todosijević, Raca
1-10 C p. 235-254
 artikel
2631 On cop-win dynamic graphs Fortin-Leblanc, Gabriel
1-10 C p. 322-328
 artikel
2632 On coupon colorings of graphs Chen, Bob
 2015
 1-10 C p. 94-101
8 p.
 artikel
2633 On cubic rainbow domination regular graphs Kuzman, Boštjan
1-10 C p. 26-38
 artikel
2634 On cut vertices and eigenvalues of character graphs of solvable groups Hafezieh, Roghayeh
1-10 C p. 86-93
 artikel
2635 On cyclic codes over Galois rings Kaur, Jasbir
1-10 C p. 156-161
 artikel
2636 On decomposition of the Cartesian product of directed cycles into cycles of equal lengths Bogdanowicz, Zbigniew R.
 2017
 1-10 C p. 148-150
3 p.
 artikel
2637 On defect restricted matching extension graphs Gan, Zhiyong
1-10 C p. 76-81
 artikel
2638 On degree resistance distance of cacti Liu, Jia-Bao
 2016
 1-10 C p. 217-225
9 p.
 artikel
2639 On del-robust primitive words Srivastava, Amit Kumar
 2016
 1-10 C p. 115-121
7 p.
 artikel
2640 On derivatives of planar mappings and their connections to complete mappings Muratović-Ribić, A.
 2018
 1-10 C p. 285-290
 artikel
2641 On difference of Zagreb indices Furtula, Boris
 2014
 1-10 C p. 83-88
6 p.
 artikel
2642 On different versions of the exact subgraph hierarchy for the stable set problem Gaar, Elisabeth
1-10 C p. 52-70
 artikel
2643 On digraphs of excess one Miller, Mirka
 2018
 1-10 C p. 161-166
 artikel
2644 On directed covering and domination problems Hanaka, Tesshu
 2019
 1-10 C p. 76-99
 artikel
2645 On diregular digraphs with degree two and excess three Tuite, James
 2019
 1-10 C p. 331-339
 artikel
2646 On diregular digraphs with degree two and excess two Tuite, James
 2018
 1-10 C p. 167-174
 artikel
2647 On disjoint hypercubes in Fibonacci cubes Gravier, Sylvain
 2015
 1-10 C p. 50-55
6 p.
 artikel
2648 On disjoint matchings in cubic graphs: Maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs Aslanyan, Davit
 2014
 1-10 C p. 12-27
16 p.
 artikel
2649 On disjunction convex hulls by big-M lifting Qu, Yushan
1-10 C p. 31-45
 artikel
2650 On disks of the triangular grid: An application of optimization theory in discrete geometry Kovács, Gergely
1-10 C p. 136-151
 artikel
2651 On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs Das, Kinkar Ch.
 2018
 1-10 C p. 172-185
 artikel
2652 On distance magic circulants of valency 6 Miklavič, Štefko
1-10 C p. 35-48
 artikel
2653 On distance-preserving elimination orderings in graphs: Complexity and algorithms Coudert, David
 2018
 1-10 C p. 140-153
 artikel
2654 On distance spectral radius of uniform hypergraphs with cycles Lin, Hongying
 2018
 1-10 C p. 125-143
 artikel
2655 On dominating sets of maximal outerplanar and planar graphs Li, Zepeng
 2016
 1-10 C p. 164-169
6 p.
 artikel
2656 On domination game stable graphs and domination game edge-critical graphs Xu, Kexiang
 2018
 1-10 C p. 47-56
 artikel
2657 On domination number and distance in graphs Kang, Cong X.
 2016
 1-10 C p. 203-206
4 p.
 artikel
2658 On d -stable locally checkable problems parameterized by mim-width Gonzalez, Carolina Lucía
1-10 C p. 1-22
 artikel
2659 On eccentric distance sum and degree distance of graphs Hua, Hongbo
 2018
 1-10 C p. 262-275
 artikel
2660 On eccentric distance sum and minimum degree Mukungunugwa, Vivian
 2014
 1-10 C p. 55-61
7 p.
 artikel
2661 On edge-b-critical graphs Eschouf, Noureddine Ikhlef
 2015
 1-10 C p. 176-180
5 p.
 artikel
2662 On edge intersection graphs of paths with 2 bends Pergel, Martin
 2017
 1-10 C p. 106-116
11 p.
 artikel
2663 On efficient domination for some classes of H -free bipartite graphs Brandstädt, Andreas
 2019
 1-10 C p. 58-67
 artikel
2664 On efficient domination for some classes of H -free chordal graphs Brandstädt, Andreas
1-10 C p. 81-95
 artikel
2665 On energy and Laplacian energy of chain graphs Das, Kinkar Chandra
1-10 C p. 391-400
 artikel
2666 On enumerating short projected models Möhle, Sibylle
1-10 C p. 412-439
 artikel
2667 On envy-free perfect matching Arbib, C.
 2019
 1-10 C p. 22-27
 artikel
2668 One pile misère bounded Nim with two alliances Zhao, Xiao
 2016
 1-10 C p. 16-33
18 p.
 artikel
2669 One-Pile Nim games with arbitrarily many random players Liu, Wen An
 2019
 1-10 C p. 56-74
 artikel
2670 On equienergetic signed graphs Bhat, Mushtaq A.
 2015
 1-10 C p. 1-7
7 p.
 artikel
2671 One-sided terrain guarding and chordal graphs Kasthurirangan, Prahlad Narasimhan
1-10 C p. 192-201
 artikel
2672 One-sided version of Gale–Shapley proposal algorithm and its likely behavior under random preferences Pittel, Boris
1-10 C p. 1-18
 artikel
2673 On (exponential) bond incident degree indices of graphs Wei, Peichao
1-10 C p. 141-147
 artikel
2674 On exponential type sequences Xue, Fang-Gang
1-10 C p. 187-189
 artikel
2675 On extendability of co-edge-regular graphs Kutnar, Klavdija
1-10 C p. 34-49
 artikel
2676 On extremal cacti with respect to the revised Szeged index Wang, Shujing
 2017
 1-10 C p. 231-239
9 p.
 artikel
2677 On extremal factors of de Bruijn-like graphs Álvarez, Nicolás
1-10 C p. 352-364
 artikel
2678 On extremal multiplicative Zagreb indices of trees with given number of vertices of maximum degree Wang, Shaohui
 2017
 1-10 C p. 166-173
 artikel
2679 On extremal spectral results of digraphs based on sum distance Xu, Leyou
1-10 C p. 47-67
 artikel
2680 On extremal values of some degree-based topological indices with a forbidden or a prescribed subgraph Gerbner, Dániel
1-10 C p. 459-466
 artikel
2681 On facial unique-maximum (edge-)coloring Andova, Vesna
 2018
 1-10 C p. 26-32
 artikel
2682 On finding connected balanced partitions of trees Bruglieri, Maurizio
1-10 C p. 1-16
 artikel
2683 On finding orientations with the fewest number of vertices with small out-degree Khoshkhah, Kaveh
 2015
 1-10 C p. 163-166
4 p.
 artikel
2684 On flips in planar matchings Milich, Marcel
1-10 C p. 427-445
 artikel
2685 On forcibly k -connected and forcibly k -arc-connected digraphic sequences Liu, Xuemei
1-10 C p. 10-18
 artikel
2686 On fractional cut covers Neto, José
 2019
 1-10 C p. 168-181
 artikel
2687 On fractional version of oriented coloring Das, Sandip
1-10 C p. 33-42
 artikel
2688 On full friendly index sets of 1-level and 2-levels N-grids Gao, Zhen-Bin
 2016
 1-10 C p. 68-78
11 p.
 artikel
2689 On gap-labellings of some families of graphs Weffort-Santos, C.A.
1-10 C p. 296-314
 artikel
2690 On general A B C -type index of connected graphs Chen, Chaohui
1-10 C p. 27-35
 artikel
2691 On generalized Vietoris’ number sequences Cação, Isabel
 2019
 1-10 C p. 77-85
 artikel
2692 On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions Gurvich, V.
 1999
 1-10 C p. 363-373
11 p.
 artikel
2693 On g -good-neighbor conditional connectivity and diagnosability of hierarchical star networks Liu, Aixia
1-10 C p. 95-113
 artikel
2694 On graph Laplacian eigenvectors with components in { − 1 , 0 , 1 } Caputo, J.-G.
 2019
 1-10 C p. 120-129
 artikel
2695 On graphs maximizing the zero forcing number Liang, Yi-Ping
1-10 C p. 81-90
 artikel
2696 On graphs that contain exactly k copies of a subgraph, and a related problem in search theory Gerbner, Dániel
1-10 C p. 196-203
 artikel
2697 On graphs whose eternal vertex cover number and vertex cover number coincide Babu, Jasine
1-10 C p. 171-182
 artikel
2698 On graphs with excess or defect 2 Garbe, Frederik
 2015
 1-10 C p. 81-88
8 p.
 artikel
2699 On graphs with maximum average eccentricity Horoldagva, Batmend
1-10 C p. 109-117
 artikel
2700 On graphs with the maximum edge metric dimension Zhu, Enqiang
 2019
 1-10 C p. 317-324
 artikel
2701 On group-valued potential differences and flows in a signed graph Ren, Xiangyu
1-10 C p. 185-192
 artikel
2702 On Hamiltonicity of regular graphs with bounded second neighborhoods Asratian, Armen S.
1-10 C p. 75-86
 artikel
2703 On hard instances of non-commutative permanent Engels, Christian
1-10 C p. 127-138
 artikel
2704 On highly palindromic words: The n -ary case Ago, Kristina
1-10 C p. 98-109
 artikel
2705 On highly palindromic words: The ternary case Ago, Kristina
1-10 C p. 434-443
 artikel
2706 On hyper-Hamiltonicity in graphs Del-Vecchio, Renata R.
1-10 C p. 195-202
 artikel
2707 On implicational bases of closure systems with unique critical sets Adaricheva, K.
 2014
 1-10 C p. 51-69
19 p.
 artikel
2708 On improving matchings in trees, via bounded-length augmentations Bensmail, Julien
 2018
 1-10 C p. 110-129
 artikel
2709 On incidence coloring conjecture in Cartesian products of graphs Gregor, Petr
 2016
 1-10 C p. 93-100
8 p.
 artikel
2710 On independent set in B 1 -EPG graphs Bessy, Stephane
1-10 C p. 62-72
 artikel
2711 On indicated coloring of lexicographic product of graphs Francis, P.
1-10 C p. 576-582
 artikel
2712 On indices of Wiener and anti-Wiener type Vukičević, Damir
 2018
 1-10 C p. 290-298
 artikel
2713 On individual leaf depths of trees Elizalde, Sergi
1-10 C p. 151-180
 artikel
2714 On induced colourful paths in triangle-free graphs Babu, Jasine
 2019
 1-10 C p. 109-116
 artikel
2715 On inertia and ratio type bounds for the k -independence number of a graph and their relationship Abiad, Aida
1-10 C p. 96-109
 artikel
2716 On injective edge-coloring of graphs with maximum degree 4 Fu, Jiacong
1-10 C p. 119-130
 artikel
2717 On integer images of max-plus linear mappings Butkovič, Peter
 2018
 1-10 C p. 62-74
 artikel
2718 On intersecting families of independent sets in trees Hurlbert, Glenn
1-10 C p. 4-9
 artikel
2719 On interval colouring reorientation number of oriented graphs Borowiecka-Olszewska, Marta
1-10 C p. 65-80
 artikel
2720 On interval representations of graphs Braga de Queiroz, Aquiles
 2016
 1-10 C p. 30-36
7 p.
 artikel
2721 On inventory allocation for periodic review assemble-to-order systems Deza, Antoine
1-10 C p. 29-41
 artikel
2722 On inverse linear programming problems under the bottleneck-type weighted Hamming distance Tayyebi, Javad
 2018
 1-10 C p. 92-101
 artikel
2723 On irredundance coloring and irredundance compelling coloring of graphs Kalarkop, David Ashok
1-10 C p. 149-161
 artikel
2724 On isomorphism between circulant and Cartesian product of 2 cycles Bogdanowicz, Zbigniew R.
 2015
 1-10 C p. 160-162
3 p.
 artikel
2725 On k -bend and monotonic ℓ -bend edge intersection graphs of paths on a grid Çela, Eranda
1-10 C p. 88-103
 artikel
2726 On ( 2 , k ) -Hamilton-connected graphs Dai, Tianjiao
1-10 C p. 288-299
 artikel
2727 On k -rainbow domination in regular graphs Kuzman, Boštjan
1-10 C p. 454-464
 artikel
2728 On k -shifted antimagic spider forests Chang, Fei-Huang
1-10 C p. 468-476
 artikel
2729 On k -uniform random hypergraphs without generalized fans Gu, Ran
1-10 C p. 98-107
 artikel
2730 On α -labellings of lobsters and trees with a perfect matching Luiz, Atílio G.
 2019
 1-10 C p. 137-151
 artikel
2731 On Lagrangian relaxation for constrained maximization and reoptimization problems Kulik, Ariel
1-10 C p. 164-178
 artikel
2732 On large ABC spectral radii of unicyclic graphs Yuan, Yan
1-10 C p. 56-65
 artikel
2733 On large regular ( 1 , 1 , k ) -mixed graphs Dalfó, C.
1-10 C p. 209-228
 artikel
2734 On leaky forcing and resilience Alameda, Joseph S.
1-10 C p. 32-45
 artikel
2735 On lengths of edge-labeled graph expressions Korenblit, Mark
1-10 C p. 583-594
 artikel
2736 Online and offline packing cylinders in a cylindrical container Moqa, Rashad
1-10 C p. 85-104
 artikel
2737 On linear algebra of balance-binomial graphs Kar, Kübra
 2018
 1-10 C p. 290-296
 artikel
2738 On linear coloring of planar graphs with small girth Dong, Wei
 2014
 1-10 C p. 35-44
10 p.
 artikel
2739 On linear layout of bicube and construction of optimal incomplete bicube Immanuel, Paul
1-10 C p. 44-52
 artikel
2740 On linear-time data dissemination in dynamic rooted trees Zeiner, Martin
 2019
 1-10 C p. 307-319
 artikel
2741 On-line DP-coloring of graphs Kim, Seog-Jin
1-10 C p. 443-453
 artikel
2742 On-line maximum matching in complete multi-partite graphs with an application to optical networks Shalom, Mordechai
 2016
 1-10 C p. 123-136
14 p.
 artikel
2743 On-line Ramsey numbers for paths and short cycles Dybizbański, Janusz
1-10 C p. 265-270
 artikel
2744 Online 2-stage stable matching Bampis, Evripidis
1-10 C p. 394-405
 artikel
2745 Online sum-paintability: Slow-coloring of trees Puleo, Gregory J.
 2019
 1-10 C p. 158-168
 artikel
2746 On list 3-dynamic coloring of near-triangulations Gu, Ruijuan
1-10 C p. 87-90
 artikel
2747 On locally finite ordered rooted trees and their rooted subtrees Agnarsson, Geir
1-10 C p. 1-21
 artikel
2748 On locally identifying coloring of Cartesian product and tensor product of graphs Bhyravarapu, Sriram
1-10 C p. 429-447
 artikel
2749 On locating and neighbor-locating colorings of sparse graphs Chakraborty, Dipayan
1-10 C p. 366-381
 artikel
2750 On matroid parity and matching polytopes Kaparis, Konstantinos
1-10 C p. 322-331
 artikel
2751 On maximum graphs in Tutte polynomial posets Kahl, Nathan
1-10 C p. 78-88
 artikel
2752 On maximum induced forests of the balanced bipartite graphs Ghalavand, Ali
1-10 C p. 1-6
 artikel
2753 On maximum k -edge-colorable subgraphs of bipartite graphs Karapetyan, Liana
 2019
 1-10 C p. 226-232
 artikel
2754 On minimally 2- T -connected directed graphs Durand de Gevigney, Olivier
 2018
 1-10 C p. 183-185
 artikel
2755 On minimizing the maximum color for the 1–2–3 Conjecture Bensmail, Julien
1-10 C p. 32-51
 artikel
2756 On minimum degree, leaf number, traceability and Hamiltonicity in graphs Mafuta, P.
 2017
 1-10 C p. 89-94
6 p.
 artikel
2757 On minimum spanning tree-like metric spaces Hayamizu, Momoko
 2017
 1-10 C p. 51-57
7 p.
 artikel
2758 On monophonic position sets in graphs Thomas, Elias John
1-10 C p. 72-82
 artikel
2759 On monotonicity in Maker–Breaker graph colouring games Hollom, Lawrence
1-10 C p. 131-138
 artikel
2760 On more variants of the Majority Problem Anglès d’Auriac, Paul-Elliot
 2019
 1-10 C p. 1-12
 artikel
2761 On m -step competition graphs of bipartite tournaments Eoh, Soogang
1-10 C p. 199-206
 artikel
2762 On Nash-solvability in pure stationary strategies of the deterministic n -person games with perfect information and mean or total effective cost Gurvich, Vladimir
 2014
 1-10 C p. 131-143
13 p.
 artikel
2763 On ( n , m ) -chromatic numbers of graphs with bounded sparsity parameters Das, Sandip
1-10 C p. 417-428
 artikel
2764 On non-existence of bent–negabent rotation symmetric Boolean functions Mandal, Bimal
 2018
 1-10 C p. 1-6
 artikel
2765 On nonrepetitive colorings of paths and cycles Botler, Fábio
1-10 C p. 221-228
 artikel
2766 On non-repetitive complexity of Arnoux–Rauzy words Medková, Kateřina
1-10 C p. 423-433
 artikel
2767 On non-repetitive sequences of arithmetic progressions: The cases k ∈ { 4 , 5 , 6 , 7 , 8 } Lužar, Borut
1-10 C p. 106-117
 artikel
2768 On NP-hard graph properties characterized by the spectrum Etesami, Omid
1-10 C p. 526-529
 artikel
2769 On null 3-hypergraphs Frosini, Andrea
1-10 C p. 76-85
 artikel
2770 On odd colorings of sparse graphs Wang, Tao
1-10 C p. 156-169
 artikel
2771 On offset Hamilton cycles in random hypergraphs Dudek, Andrzej
 2018
 1-10 C p. 77-85
 artikel
2772 On one extension of Dirac’s theorem on Hamiltonicity Büyükçolak, Yasemin
 2019
 1-10 C p. 10-16
 artikel
2773 On open-separating dominating codes in graphs Chakraborty, Dipayan
1-10 C p. 215-238
 artikel
2774 On opposition graphs, coalition graphs, and bipartite permutation graphs Le, Van Bang
 2014
 1-10 C p. 26-33
8 p.
 artikel
2775 On optimal approximability results for computing the strong metric dimension DasGupta, Bhaskar
 2017
 1-10 C p. 18-24
7 p.
 artikel
2776 On optimal piercing of a square Bašić, Bojan
1-10 C p. 242-251
 artikel
2777 On oriented cliques with respect to push operation Bensmail, Julien
 2017
 1-10 C p. 50-63
 artikel
2778 On oriented diameter of ( n , k ) -star graphs Ajish Kumar, K.S.
1-10 C p. 214-228
 artikel
2779 On orthogonal ray trees Mustaţă, Irina
 2016
 1-10 C p. 201-212
12 p.
 artikel
2780 On packing colorings of distance graphs Togni, Olivier
 2014
 1-10 C p. 280-289
10 p.
 artikel
2781 On packing S -colorings of subcubic graphs Yang, Wei
1-10 C p. 1-14
 artikel
2782 On pancyclic arcs in hypertournaments Li, Hongwei
 2016
 1-10 C p. 164-170
7 p.
 artikel
2783 On partial cubes, well-graded families and their duals with some applications in graphs Mofidi, Alireza
1-10 C p. 207-230
 artikel
2784 On partial Grundy coloring of bipartite graphs and chordal graphs Panda, B.S.
 2019
 1-10 C p. 171-183
 artikel
2785 On partitioning minimum spanning trees Guttmann-Beck, Nili
1-10 C p. 45-54
 artikel
2786 On partitions of graphs under degree constraints Liu, Muhuo
 2017
 1-10 C p. 87-93
7 p.
 artikel
2787 On partitions with k corners not containing the staircase with one more corner Briand, Emmanuel
1-10 C p. 162-168
 artikel
2788 On point-line incidences in vector spaces over finite fields Vinh, Le Anh
 2014
 1-10 C p. 146-151
6 p.
 artikel
2789 On polygon numbers of circle graphs and distance hereditary graphs Stewart, Lorna
 2018
 1-10 C p. 3-17
 artikel
2790 On polynomial time inflation algorithm for loop-free non-negative edge-bipartite graphs Zając, Katarzyna
1-10 C p. 28-43
 artikel
2791 On “Practical and secure outsourcing algorithms for solving quadratic congruences in IoTs” from IEEE IoT journal Rangasamy, Jothi
1-10 C p. 139-146
 artikel
2792 On proper conflict-free colorings of IC-planar graphs Wu, Yali
1-10 C p. 217-223
 artikel
2793 On q -nearly bent Boolean functions Chen, Zhixiong
1-10 C p. 210-217
 artikel
2794 On quasi-monotonous graphs Kouider, Mekkia
 2016
 1-10 C p. 155-163
9 p.
 artikel
2795 On quasi-planar graphs: Clique-width and logical description Courcelle, Bruno
1-10 C p. 118-135
 artikel
2796 On 2-rainbow domination of generalized Petersen graphs Shao, Zehui
 2019
 1-10 C p. 370-384
 artikel
2797 On rainbow domination of generalized Petersen graphs P ( c k , k ) Žerovnik, Janez
1-10 C p. 440-448
 artikel
2798 On rainbow total-coloring of a graph Sun, Yuefang
 2015
 1-10 C p. 171-177
7 p.
 artikel
2799 On Ramsey and star-critical Ramsey numbers for generalized fans versus n K m Hamm, Arran
1-10 C p. 64-70
 artikel
2800 On Ramsey numbers of complete graphs with dropped stars Chappelon, Jonathan
 2016
 1-10 C p. 200-206
 artikel
2801 On random multi-dimensional assignment problems Frieze, Alan
1-10 C p. 1-9
 artikel
2802 On rank and MDR cyclic and negacyclic codes of length p k over Z p m Garg, Arpana
1-10 C p. 581-590
 artikel
2803 On rational Dyck paths and the enumeration of factor-free Dyck words Birmajer, Daniel
 2018
 1-10 C p. 36-43
 artikel
2804 On r -dynamic chromatic number of graphs Taherkhani, Ali
 2016
 1-10 C p. 222-227
6 p.
 artikel
2805 On r -dynamic coloring of graphs Jahanbekam, Sogol
 2016
 1-10 C p. 65-72
8 p.
 artikel
2806 On r -dynamic coloring of grids Kang, Ross
 2015
 1-10 C p. 286-290
5 p.
 artikel
2807 On realizations of a joint degree matrix Czabarka, Éva
 2015
 1-10 C p. 283-288
6 p.
 artikel
2808 On reconstruction of eigenfunctions of Johnson graphs Vorob’ev, Konstantin
1-10 C p. 166-171
 artikel
2809 On rectangle intersection graphs with stab number at most two Chakraborty, Dibyayan
1-10 C p. 354-365
 artikel
2810 On redundant locating-dominating sets Jean, Devin C.
1-10 C p. 106-125
 artikel
2811 On regular and new types of codes for location-domination Junnila, Ville
1-10 C p. 225-241
 artikel
2812 On regular 2-path Hamiltonian graphs Li, Xia
1-10 C p. 61-70
 artikel
2813 On relationship between Hamiltonian path and holes in L ( 3 , 2 , 1 ) -coloring of minimum span Sarkar, Ushnish
 2017
 1-10 C p. 227-234
8 p.
 artikel
2814 On r -equitable chromatic threshold of Kronecker products of complete graphs Wang, Wei
 2014
 1-10 C p. 129-134
6 p.
 artikel
2815 On r -hued coloring of planar graphs with girth at least 6 Song, Huimin
 2016
 1-10 C p. 251-263
13 p.
 artikel
2816 On r -hued list coloring of K 4 ( 7 ) -minor free graphs Wei, Wenjuan
1-10 C p. 301-309
 artikel
2817 On r -uniform hypergraphs with circumference less than r Kostochka, Alexandr
1-10 C p. 69-91
 artikel
2818 On saturated non-covered graphs Zhou, Jinqiu
1-10 C p. 53-59
 artikel
2819 On selecting a fraction of leaves with disjoint neighborhoods in a plane tree Junginger, Kolja
1-10 C p. 141-148
 artikel
2820 On self-clique shoal graphs Larrión, F.
 2016
 1-10 C p. 86-100
15 p.
 artikel
2821 On self-dual double negacirculant codes Alahmadi, Adel
 2017
 1-10 C p. 205-212
8 p.
 artikel
2822 On semi-transitivity of (extended) Mycielski graphs Hameed, Humaira
1-10 C p. 83-88
 artikel
2823 On separating systems with bounded set size Wiener, Gábor
1-10 C p. 172-176
 artikel
2824 On set expansion problems and the small set expansion conjecture Gandhi, Rajiv
 2015
 1-10 C p. 93-101
9 p.
 artikel
2825 On shortening u-cycles and u-words for permutations Kitaev, Sergey
 2019
 1-10 C p. 203-213
 artikel
2826 On simplified NP-complete variants of Monotone 3 -Sat Darmann, Andreas
1-10 C p. 45-58
 artikel
2827 On some classes of quasi-triangulated graphs Eschen, Elaine M.
1-10 C p. 419-424
 artikel
2828 On some conjectures on biclique graphs Liang, Yanfang
1-10 C p. 184-190
 artikel
2829 On some domination colorings of graphs Bagan, Guillaume
 2017
 1-10 C p. 34-50
17 p.
 artikel
2830 On some graph classes related to perfect graphs: A survey Bonomo-Braberman, Flavia
1-10 C p. 42-60
 artikel
2831 On some open problems concerning quorum colorings of graphs Sahbi, Rafik
1-10 C p. 294-299
 artikel
2832 On some properties of limited move stability, generalized metarationality, and policy equilibrium in bilateral conflicts Silva, Alecio Soares
1-10 C p. 111-121
 artikel
2833 On some special classes of contact B 0 -VPG graphs Bonomo-Braberman, Flavia
1-10 C p. 111-129
 artikel
2834 On some three-color Ramsey numbers for paths Dybizbański, Janusz
 2016
 1-10 C p. 133-141
9 p.
 artikel
2835 On S -packing edge-colorings of cubic graphs Gastineau, Nicolas
 2019
 1-10 C p. 63-75
 artikel
2836 On spectral extrema of graphs with given order and dissociation number Huang, Jing
1-10 C p. 368-380
 artikel
2837 On spectral invariants of the α -mixed adjacency matrix Andrade, Enide
1-10 C p. 300-327
 artikel
2838 On spectral radius of generalized arithmetic–geometric matrix of connected graphs and its applications Chen, Xiaodan
1-10 C p. 1-12
 artikel
2839 On spectrum assignment in elastic optical tree-networks Bermond, Jean-Claude
 2019
 1-10 C p. 40-52
 artikel
2840 On split graphs with four distinct eigenvalues Goldberg, Felix
1-10 C p. 163-171
 artikel
2841 On stable assignments generated by choice functions of mixed type Karzanov, Alexander V.
1-10 C p. 112-135
 artikel
2842 On star 5-colorings of sparse graphs Choi, Ilkyoo
1-10 C p. 233-252
 artikel
2843 On star-critical and upper size Ramsey numbers Zhang, Yanbo
 2016
 1-10 C p. 174-180
7 p.
 artikel
2844 On star edge colorings of bipartite and subcubic graphs Casselgren, Carl Johan
1-10 C p. 21-33
 artikel
2845 On stars in caterpillars and lobsters Estrugo, Emiliano J.J.
1-10 C p. 50-55
 artikel
2846 On ( 1 , 2 ) -step competition graphs of bipartite tournaments Choi, Jihoon
 2017
 1-10 C p. 107-115
 artikel
2847 On strictly chordality- k graphs Dhanalakshmi, S.
1-10 C p. 93-112
 artikel
2848 On strong edge-coloring of graphs with maximum degree 4 Lv, Jian-Bo
 2018
 1-10 C p. 142-153
 artikel
2849 On strong edge-coloring of graphs with maximum degree 5 Lu, Jian
1-10 C p. 120-128
 artikel
2850 On strongly asymmetric and controllable primitive graphs Farrugia, Alexander
 2016
 1-10 C p. 58-67
10 p.
 artikel
2851 On strongly regular signed graphs Stanić, Zoran
 2019
 1-10 C p. 184-190
 artikel
2852 On strongly Z 2 s + 1 -connected graphs Lai, Hong-Jian
 2014
 1-10 C p. 73-80
8 p.
 artikel
2853 On strong proper connection number of cubic graphs Huang, Fei
 2019
 1-10 C p. 104-119
 artikel
2854 On structural parameterizations for the 2-club problem Hartung, Sepp
 2015
 1-10 C p. 79-92
14 p.
 artikel
2855 On structural parameterizations of load coloring Reddy, I. Vinod
1-10 C p. 181-189
 artikel
2856 On structural properties of trees with minimal atom-bond connectivity index Dimitrov, Darko
 2014
 1-10 C p. 28-44
17 p.
 artikel
2857 On structural properties of trees with minimal atom-bond connectivity index II: Bounds on B 1 - and B 2 -branches Dimitrov, Darko
 2016
 1-10 C p. 90-116
27 p.
 artikel
2858 On subclasses of interval count two and on Fishburn’s conjecture Francis, Mathew C.
1-10 C p. 236-251
 artikel
2859 On sufficient spectral radius conditions for hamiltonicity Zhou, Qiannan
1-10 C p. 26-38
 artikel
2860 On sum edge-coloring of regular, bipartite and split graphs Petrosyan, P.A.
 2014
 1-10 C p. 263-269
7 p.
 artikel
2861 On sum of powers of normalized Laplacian eigenvalues and resistance distances of graphs Sun, Wenwen
1-10 C p. 179-186
 artikel
2862 On tame, pet, domestic, and miserable impartial games Gurvich, Vladimir
 2018
 1-10 C p. 54-72
 artikel
2863 On the absolute and relative oriented clique problems’ time complexity Coelho, E.M.M.
1-10 C p. 53-65
 artikel
2864 On the acyclic disconnection and the girth Balbuena, Camino
 2015
 1-10 C p. 13-18
6 p.
 artikel
2865 On the additive complexity of a Thue–Morse-like sequence Chen, Jin
 2019
 1-10 C p. 98-108
 artikel
2866 On the (adjacency) metric dimension of corona and strong product graphs and their local variants: Combinatorial and computational results Fernau, Henning
 2018
 1-10 C p. 183-202
 artikel
2867 On the A α -index of graphs with given order and dissociation number Zhou, Zihan
1-10 C p. 167-180
 artikel
2868 On the algebraic immunity of direct sum constructions Méaux, Pierrick
1-10 C p. 223-234
 artikel
2869 On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs Dehghan, Ali
 2017
 1-10 C p. 82-97
16 p.
 artikel
2870 On the algorithmic complexity of k -tuple total domination Lan, James K.
 2014
 1-10 C p. 81-91
11 p.
 artikel
2871 On the anti-Kekulé number of (4,5,6)-fullerenes Zhao, Lifang
1-10 C p. 577-589
 artikel
2872 On the anti-Ramsey number of forests Fang, Chunqiu
1-10 C p. 129-142
 artikel
2873 On the A α -spectral radius of graphs with given size Chen, Hongzhang
1-10 C p. 350-362
 artikel
2874 On the asymptotic order of circuit codes Byrnes, Kevin M.
1-10 C p. 69-73
 artikel
2875 On the AVDTC of Sierpiński-type graphs Palma, Miguel A.D.R.
1-10 C p. 10-29
 artikel
2876 On the average hitting times of Cay ( Z N , { + 1 , + 2 } ) Tanaka, Yuuho
1-10 C p. 269-276
 artikel
2877 On the average hitting times of the squares of cycles Doi, Yoshiaki
1-10 C p. 18-28
 artikel
2878 On the average number of reversals needed to sort signed permutations de Lima, Thaynara Arielly
 2018
 1-10 C p. 59-80
 artikel
2879 On the average Steiner 3-eccentricity of trees Li, Xingfu
1-10 C p. 181-195
 artikel
2880 On the balanceability of some graph classes Dailly, Antoine
1-10 C p. 51-63
 artikel
2881 On the bandwidth of the Kneser graph Jiang, Tao
 2017
 1-10 C p. 84-94
 artikel
2882 On the barrier graph of an arrangement of ray sensors Boyer, Kirk
 2017
 1-10 C p. 11-21
11 p.
 artikel
2883 On the b-chromatic number of cartesian products Guo, Chuan
 2018
 1-10 C p. 82-93
 artikel
2884 On the b -chromatic number of regular bounded graphs Amine, El Sahili
 2015
 1-10 C p. 174-179
6 p.
 artikel
2885 On the b -coloring of G − e Zamime, Mohamed
 2015
 1-10 C p. 41-50
10 p.
 artikel
2886 On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid Alcón, Liliana
 2018
 1-10 C p. 12-21
 artikel
2887 On the bend-number of planar and outerplanar graphs Heldt, Daniel
 2014
 1-10 C p. 109-119
11 p.
 artikel
2888 On the bipartite graph packing problem Vásárhelyi, Bálint
 2017
 1-10 C p. 149-155
 artikel
2889 On the bitprobe complexity of two probe adaptive schemes Kesh, Deepanjan
1-10 C p. 132-140
 artikel
2890 On the bounds for signless Laplacian energy of a graph Ganie, Hilal A.
 2017
 1-10 C p. 3-13
11 p.
 artikel
2891 On the broadcast independence number of caterpillars Ahmane, Messaouda
 2018
 1-10 C p. 20-35
 artikel
2892 On the Bruhat order of labeled graphs Brualdi, Richard A.
 2019
 1-10 C p. 49-64
 artikel
2893 On the characterization of some algebraically defined bipartite graphs of girth eight Xu, Ming
1-10 C p. 221-232
 artikel
2894 On the chromatic index of join graphs and triangle-free graphs with large maximum degree Zorzi, A.
 2018
 1-10 C p. 183-189
 artikel
2895 On the chromatic number of graphs of odd girth without longer odd holes Wang, Hongyang
1-10 C p. 227-230
 artikel
2896 On the chromatic number of 2 K 2 -free graphs Brause, Christoph
 2019
 1-10 C p. 14-24
 artikel
2897 On the chromatic number of powers of subdivisions of graphs Anastos, Michael
1-10 C p. 506-511
 artikel
2898 On the chromatic number of random subgraphs of a certain distance graph Pyaderkin, M.M.
 2019
 1-10 C p. 209-214
 artikel
2899 On the chromatic numbers of small-dimensional Euclidean spaces Cherkashin, Danila
 2018
 1-10 C p. 125-131
 artikel
2900 On the classification and dispersability of circulant graphs with two jump lengths Yu, Xiaoxiang
1-10 C p. 268-286
 artikel
2901 On the clique-width of ( 4 K 1 , C 4 , C 5 , C 7 ) -free graphs Penev, Irena
1-10 C p. 688-690
 artikel
2902 On the closest point to the origin in transportation polytopes Calvillo, Gilberto
 2016
 1-10 C p. 88-102
 artikel
2903 On the Colijn–Plazzotta numbering scheme for unlabeled binary rooted trees Rosenberg, Noah A.
1-10 C p. 88-98
 artikel
2904 On the competition graphs of d -partial orders Choi, Jihoon
 2016
 1-10 C p. 29-37
9 p.
 artikel
2905 On the complexity and approximation of the maximum expected value all-or-nothing subset Goldberg, Noam
1-10 C p. 1-10
 artikel
2906 On the complexity of cd-coloring of graphs M.A., Shalu
1-10 C p. 171-185
 artikel
2907 On the complexity of container stowage planning problems Tierney, Kevin
 2014
 1-10 C p. 225-230
6 p.
 artikel
2908 On the complexity of finding and counting solution-free sets of integers Meeks, Kitty
 2018
 1-10 C p. 219-238
 artikel
2909 On the complexity of k -rainbow cycle colouring problems Li, Shasha
 2019
 1-10 C p. 125-133
 artikel
2910 On the complexity of min–max–min robustness with two alternatives and budgeted uncertainty Chassein, André
1-10 C p. 141-163
 artikel
2911 On the complexity of rainbow coloring problems Eiben, Eduard
 2018
 1-10 C p. 38-48
 artikel
2912 On the complexity of robust multi-stage problems with discrete recourse Goerigk, Marc
1-10 C p. 355-370
 artikel
2913 On the complexity of the Cable-Trench Problem Benedito, Marcelo P.L.
1-10 C p. 272-285
 artikel
2914 On the complexity of the flow coloring problem Campêlo, Manoel
 2015
 1-10 C p. 75-92
18 p.
 artikel
2915 On the complexity of the identifiable subgraph problem Kamiński, Marcin
 2015
 1-10 C p. 25-33
9 p.
 artikel
2916 On the complexity of the identifiable subgraph problem, revisited Kratsch, Stefan
 2017
 1-10 C p. 78-86
9 p.
 artikel
2917 On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size Lin, Min Chih
 2015
 1-10 C p. 53-58
6 p.
 artikel
2918 On the complexity of the regenerator location problem treewidth and other parameters Hartstein, Itamar
 2016
 1-10 C p. 199-225
27 p.
 artikel
2919 On the complexity of the shortest-path broadcast problem Crescenzi, Pierluigi
 2016
 1-10 C p. 101-109
9 p.
 artikel
2920 On the computational complexities of various Geography variants Fox, Nathan
1-10 C p. 105-128
 artikel
2921 On the computational complexity of closest genome problems Cunha, Luís Felipe I.
1-10 C p. 26-34
 artikel
2922 On the conjecture of bijection between perfect matching and sub-hypercube in folded hypercubes Lü, Huazhong
1-10 C p. 192-194
 artikel
2923 On the conjecture of the r -uniform supertrees with the eight largest α -spectral radii Wang, Wen-Huan
1-10 C p. 311-319
 artikel
2924 On the connectivity and restricted edge-connectivity of 3-arc graphs Balbuena, C.
 2014
 1-10 C p. 90-99
10 p.
 artikel
2925 On the connectivity and the diameter of betweenness-uniform graphs Hartman, David
1-10 C p. 27-37
 artikel
2926 On the connectivity properties and energy of Fibonomial graphs Akbulak, Mehmet
 2014
 1-10 C p. 1-8
8 p.
 artikel
2927 On the construction of locally most reliable two-terminal graphs Gong, Shi-Cai
1-10 C p. 393-402
 artikel
2928 On the construction of non- 2 -colorable uniform hypergraphs Mathews, Jithin
 2015
 1-10 C p. 181-187
7 p.
 artikel
2929 On the constructions of resilient Boolean functions with five-valued Walsh spectra and resilient semi-bent functions Su, Sihong
1-10 C p. 1-12
 artikel
2930 On the continuity of graph parameters Hurshman, M.
 2015
 1-10 C p. 123-129
7 p.
 artikel
2931 On the contour of bipartite graphs Artigas, D.
 2018
 1-10 C p. 148-154
 artikel
2932 On the conversion of multivalued to Boolean dynamics Tonello, Elisa
 2019
 1-10 C p. 193-204
 artikel
2933 On the convexity of independent set games Xiao, Han
1-10 C p. 271-276
 artikel
2934 On the cryptographic properties of weightwise affine and weightwise quadratic functions Méaux, Pierrick
1-10 C p. 13-29
 artikel
2935 On the cut number problem for the 4, and 5-cubes Emamy-K, M.R.
1-10 C p. 66-75
 artikel
2936 On the degree Kirchhoff index of unicyclic graphs Qi, Xuli
1-10 C p. 86-98
 artikel
2937 On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme Abiad, Aida
1-10 C p. 221-230
 artikel
2938 On the diameter of Schrijver graphs Ledezma, Agustina Victoria
1-10 C p. 15-30
 artikel
2939 On the difference between proximity and other distance parameters in triangle-free graphs and C 4 -free graphs Dankelmann, Peter
1-10 C p. 295-307
 artikel
2940 On the difference between the (revised) Szeged index and the Wiener index of cacti Klavžar, Sandi
1-10 C p. 77-89
 artikel
2941 On the difference between the Szeged index and the Wiener index of cacti Wang, Min
1-10 C p. 35-37
 artikel
2942 On the differential and Roman domination number of a graph with minimum degree two Bermudo, Sergio
 2017
 1-10 C p. 64-72
 artikel
2943 On the (di)graphs with (directed) proper connection number two Ducoffe, Guillaume
1-10 C p. 203-215
 artikel
2944 On the distance-edge-monitoring numbers of graphs Yang, Chenxu
1-10 C p. 153-167
 artikel
2945 On the distance Laplacian spectral radius of bipartite graphs Niu, Aihong
 2015
 1-10 C p. 207-213
7 p.
 artikel
2946 On the distance spread of cacti and bicyclic graphs Liang, Yijuan
 2016
 1-10 C p. 195-202
8 p.
 artikel
2947 On the distinguishing number of cyclic tournaments: Towards the Albertson–Collins Conjecture Meslem, Kahina
 2019
 1-10 C p. 219-236
 artikel
2948 On the dominating (induced) cycles of iterated line graphs Fang, Yibin
1-10 C p. 43-51
 artikel
2949 On the dominating induced matching problem: Spectral results and sharp bounds Andrade, Enide
 2018
 1-10 C p. 22-31
 artikel
2950 On the domination number of permutation graphs and an application to strong fixed points Baren, Theresa
1-10 C p. 20-34
 artikel
2951 On the double Roman domination in graphs Abdollahzadeh Ahangar, Hossein
 2017
 1-10 C p. 1-7
 artikel
2952 On the dualization in distributive lattices and related problems Defrain, Oscar
1-10 C p. 85-96
 artikel
2953 On the dual of the solvency cone Löhne, Andreas
 2015
 1-10 C p. 176-185
10 p.
 artikel
2954 On the eccentric connectivity index of k -uniform hyper-cacti Wang, Yuan
1-10 C p. 101-118
 artikel
2955 On the eccentric connectivity index of trees with given domination number Zhou, Ting
1-10 C p. 512-519
 artikel
2956 On the eccentric connectivity index of uniform hypergraphs Weng, Weiming
1-10 C p. 180-193
 artikel
2957 On the eccentric distance sum of trees with given maximum degree Zhou, Ting
1-10 C p. 79-86
 artikel
2958 On the eccentricity spectra of threshold graphs Qiu, Zhengping
1-10 C p. 75-85
 artikel
2959 On the eccentric subtree number in trees Zhang, Xiu-Mei
1-10 C p. 123-132
 artikel
2960 On the edge-connectivity of the square of a graph Balbuena, Camino
1-10 C p. 250-256
 artikel
2961 On the edge dimension and the fractional edge dimension of graphs Yi, Eunjeong
1-10 C p. 120-130
 artikel
2962 On the edge-Szeged index of unicyclic graphs with perfect matchings He, Shengjie
1-10 C p. 207-223
 artikel
2963 On the eigenvalues and Seidel eigenvalues of chain graphs Xiong, Zhuang
1-10 C p. 44-53
 artikel
2964 On the eigenvalues of eccentricity matrix of graphs Lei, Xingyu
1-10 C p. 134-147
 artikel
2965 On the embedding of cone graphs in the line with distinct distances between neighbors Zhou, Rodrigo M.
 2019
 1-10 C p. 157-162
 artikel
2966 On the enumeration of bipartite simple games Freixas, Josep
1-10 C p. 129-141
 artikel
2967 On the equitable total chromatic number of cubic graphs Dantas, S.
 2016
 1-10 C p. 84-91
8 p.
 artikel
2968 On the equivalence of cylinder tilings and planar electric networks Amiet, Ben
1-10 C p. 762-769
 artikel
2969 On the Estrada index of cactus graphs Li, Faxu
 2016
 1-10 C p. 94-105
12 p.
 artikel
2970 On the event distance of Poisson processes with applications to sensors Kranakis, Evangelos
 2014
 1-10 C p. 152-162
11 p.
 artikel
2971 On the exact size of maximum impulse radio sequences with parameters ( m , k , λ , k − 1 ) Zhou, Junling
 2014
 1-10 C p. 122-136
15 p.
 artikel
2972 On the excessive [ m ] -index of a tree Mazzuoccolo, G.
 2014
 1-10 C p. 264-270
7 p.
 artikel
2973 On the existence of graphs which can colour every regular graph Mazzuoccolo, Giuseppe
1-10 C p. 246-256
 artikel
2974 On the existence of vertex-disjoint subgraphs with high degree sum Chiba, Shuya
 2018
 1-10 C p. 84-95
 artikel
2975 On the extremal graphs for general sum-connectivity index ( χ α ) with given cyclomatic number when α > 1 Ali, Akbar
 2019
 1-10 C p. 19-30
 artikel
2976 On the extremal graphs of diameter 2 with respect to the eccentric resistance-distance sum He, Chunling
 2017
 1-10 C p. 71-81
11 p.
 artikel
2977 On the extremal graphs with respect to bond incident degree indices Ali, Akbar
 2018
 1-10 C p. 32-40
 artikel
2978 On the extremal maximum agreement subtree problem Markin, Alexey
1-10 C p. 612-620
 artikel
2979 On the extremal sizes of maximal graphs without ( k + 1 ) -connected subgraphs Xu, Liqiong
1-10 C p. 397-406
 artikel
2980 On the extremal values of the eccentric distance sum of trees Miao, Lianying
 2015
 1-10 C p. 199-206
8 p.
 artikel
2981 On the extremal values of the eccentric distance sum of trees with a given domination number Miao, Lianying
 2017
 1-10 C p. 113-120
8 p.
 artikel
2982 On the extremal values of the eccentric distance sum of trees with a given maximum degree Miao, Lianying
1-10 C p. 375-383
 artikel
2983 On the extreme eccentric distance sum of graphs with some given parameters Li, Shuchao
 2016
 1-10 C p. 90-99
10 p.
 artikel
2984 On the Fibonacci numbers of the composition of graphs Dosal-Trujillo, Loiret Alejandría
 2019
 1-10 C p. 213-218
 artikel
2985 On the first-order edge tenacity of a graph Bafandeh, Bahareh
 2016
 1-10 C p. 8-15
8 p.
 artikel
2986 On the forbidden induced subgraph probe and sandwich problems Couto, Fernanda
 2018
 1-10 C p. 56-66
 artikel
2987 On the foundations and extremal structure of the holographic entropy cone Avis, David
1-10 C p. 16-39
 artikel
2988 On the fractional metric dimension of graphs Feng, Min
 2014
 1-10 C p. 55-63
9 p.
 artikel
2989 On the fractional strong metric dimension of graphs Kang, Cong X.
 2016
 1-10 C p. 153-161
9 p.
 artikel
2990 On the further relation between the (revised) Szeged index and the Wiener index of graphs Zhang, Huihui
 2016
 1-10 C p. 152-164
13 p.
 artikel
2991 On the Galois lattice of bipartite distance hereditary graphs Apollonio, Nicola
 2015
 1-10 C p. 13-23
11 p.
 artikel
2992 On the game coloring index of F + -decomposable graphs Charpentier, Clément
 2018
 1-10 C p. 73-83
 artikel
2993 On the generality of the greedy algorithm for solving matroid base problems Turner, Lara
 2015
 1-10 C p. 114-128
15 p.
 artikel
2994 On the generalized Helly property of hypergraphs, cliques, and bicliques Dourado, Mitre C.
1-10 C p. 56-77
 artikel
2995 On the generalized Turán number of star forests Liu, Yan-Jiao
1-10 C p. 213-221
 artikel
2996 On the generalized Wiener polarity index of trees with a given diameter Yue, Jun
 2018
 1-10 C p. 279-285
 artikel
2997 On the general position number of Mycielskian graphs Thomas, Elias John
1-10 C p. 29-43
 artikel
2998 On the General Randić index of polymeric networks modelled by generalized Sierpiński graphs Estrada-Moreno, Alejandro
 2019
 1-10 C p. 140-151
 artikel
2999 On the general sum-connectivity index of connected unicyclic graphs with k pendant vertices Tomescu, Ioan
 2015
 1-10 C p. 306-309
4 p.
 artikel
3000 On the general sum-connectivity index of trees with given number of pendent vertices Cui, Qing
 2017
 1-10 C p. 213-221
9 p.
 artikel
                             4674 gevonden resultaten
 
<< vorige    volgende >>
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland