|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
3648 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 2001 | On coloring a class of claw-free and hole-twin-free graphs |
Dai, Yingjun |
|
96-97 | Index 1 |
p. 162-170 |
artikel |
|
| 2002 | On colorings of the Boolean lattice avoiding a rainbow copy of a poset |
Patkós, Balázs |
|
96-97 | Index 1 |
p. 108-114 |
artikel |
|
| 2003 | On combinatorial properties of the Arshon sequence |
Klepinin, A.V. |
2001 |
96-97 | Index 1 |
p. 155-169 15 p. |
artikel |
|
| 2004 | On common edges in optimal solutions to traveling salesman and other optimization problems |
Chrobak, M. |
1988 |
96-97 | Index 1 |
p. 101-111 11 p. |
artikel |
|
| 2005 | On compact and efficient routing in certain graph classes |
Dragan, Feodor F. |
2007 |
96-97 | Index 1 |
p. 1458-1470 13 p. |
artikel |
|
| 2006 | On compatibility and incompatibility of collections of unrooted phylogenetic trees |
Fernández-Baca, David |
2018 |
96-97 | Index 1 |
p. 42-58 |
artikel |
|
| 2007 | On completing latin squares |
Easton, T. |
2001 |
96-97 | Index 1 |
p. 167-181 15 p. |
artikel |
|
| 2008 | On complexity of minimization and compression problems for models of sequential choice |
Sholomov, L.A. |
2004 |
96-97 | Index 1 |
p. 281-300 20 p. |
artikel |
|
| 2009 | On complexity of Minimum Leaf Out-Branching problem |
Dankelmann, Peter |
2009 |
96-97 | Index 1 |
p. 3000-3004 5 p. |
artikel |
|
| 2010 | On complexity, representation and approximation of integral multicommodity flows |
Srivastav, Anand |
2000 |
96-97 | Index 1 |
p. 183-208 26 p. |
artikel |
|
| 2011 | On 3-component domination numbers in graphs |
Gao, Zhipeng |
|
96-97 | Index 1 |
p. 53-62 |
artikel |
|
| 2012 | On conflict-free connection of graphs |
Chang, Hong |
2019 |
96-97 | Index 1 |
p. 167-182 |
artikel |
|
| 2013 | On connectivities of edge-colored graphs |
Yoshimoto, Kiyoshi |
|
96-97 | Index 1 |
p. 87-92 |
artikel |
|
| 2014 | On constant discrete programming problems |
Gabovich, E.Ya. |
1980 |
96-97 | Index 1 |
p. 193-205 13 p. |
artikel |
|
| 2015 | On constructing rational spanning tree edge densities |
Kahl, Nathan |
2016 |
96-97 | Index 1 |
p. 224-232 9 p. |
artikel |
|
| 2016 | On convergence of scatter search and star paths with directional rounding for 0–1 mixed integer programs |
Todosijević, Raca |
|
96-97 | Index 1 |
p. 235-254 |
artikel |
|
| 2017 | On counting interval lengths of interval graphs |
Cerioli, Márcia R. |
2011 |
96-97 | Index 1 |
p. 532-543 12 p. |
artikel |
|
| 2018 | On coupon colorings of graphs |
Chen, Bob |
2015 |
96-97 | Index 1 |
p. 94-101 8 p. |
artikel |
|
| 2019 | On cryptographic protocols employing asymmetric pairings — The role of Ψ revisited |
Chatterjee, Sanjit |
2011 |
96-97 | Index 1 |
p. 1311-1322 12 p. |
artikel |
|
| 2020 | On cube-free ω-words generated by binary morphisms |
Karhumäki, Juhani |
1983 |
96-97 | Index 1 |
p. 279-297 19 p. |
artikel |
|
| 2021 | On cyclic edge-connectivity of fullerenes |
Kutnar, Klavdija |
2008 |
96-97 | Index 1 |
p. 1661-1669 9 p. |
artikel |
|
| 2022 | On (d,2)-dominating numbers of binary undirected de Bruijn graphs |
Lu, Changhong |
2000 |
96-97 | Index 1 |
p. 137-145 9 p. |
artikel |
|
| 2023 | On decision and optimization (k,l)-graph sandwich problems |
Dantas, Simone |
2004 |
96-97 | Index 1 |
p. 155-165 11 p. |
artikel |
|
| 2024 | On defensive alliances and strong global offensive alliances |
Dourado, Mitre C. |
2014 |
96-97 | Index 1 |
p. 136-141 6 p. |
artikel |
|
| 2025 | On degeneracy in linear complementarity problems |
Saviozzi, G. |
1985 |
96-97 | Index 1 |
p. 311-314 4 p. |
artikel |
|
| 2026 | On determining non-isotopic configurations of points on a circle |
He, Xin |
1995 |
96-97 | Index 1 |
p. 33-50 18 p. |
artikel |
|
| 2027 | On diagnosability of large multiprocessor networks |
Ahlswede, R. |
2008 |
96-97 | Index 1 |
p. 3464-3474 11 p. |
artikel |
|
| 2028 | On difference of Zagreb indices |
Furtula, Boris |
2014 |
96-97 | Index 1 |
p. 83-88 6 p. |
artikel |
|
| 2029 | On different versions of the exact subgraph hierarchy for the stable set problem |
Gaar, Elisabeth |
|
96-97 | Index 1 |
p. 52-70 |
artikel |
|
| 2030 | On digraphs of excess one |
Miller, Mirka |
2018 |
96-97 | Index 1 |
p. 161-166 |
artikel |
|
| 2031 | On dimensional rigidity of bar-and-joint frameworks |
Alfakih, Abdo Y. |
2007 |
96-97 | Index 1 |
p. 1244-1253 10 p. |
artikel |
|
| 2032 | On directed covering and domination problems |
Hanaka, Tesshu |
2019 |
96-97 | Index 1 |
p. 76-99 |
artikel |
|
| 2033 | On diregular digraphs with degree two and excess three |
Tuite, James |
2019 |
96-97 | Index 1 |
p. 331-339 |
artikel |
|
| 2034 | On diregular digraphs with degree two and excess two |
Tuite, James |
2018 |
96-97 | Index 1 |
p. 167-174 |
artikel |
|
| 2035 | On disjoint hypercubes in Fibonacci cubes |
Gravier, Sylvain |
2015 |
96-97 | Index 1 |
p. 50-55 6 p. |
artikel |
|
| 2036 | On disjunction convex hulls by big-M lifting |
Qu, Yushan |
|
96-97 | Index 1 |
p. 31-45 |
artikel |
|
| 2037 | On disks of the triangular grid: An application of optimization theory in discrete geometry |
Kovács, Gergely |
|
96-97 | Index 1 |
p. 136-151 |
artikel |
|
| 2038 | On distance magic circulants of valency 6 |
Miklavič, Štefko |
|
96-97 | Index 1 |
p. 35-48 |
artikel |
|
| 2039 | On distance-3 matchings and induced matchings |
Brandstädt, Andreas |
2011 |
96-97 | Index 1 |
p. 509-520 12 p. |
artikel |
|
| 2040 | On distance-preserving elimination orderings in graphs: Complexity and algorithms |
Coudert, David |
2018 |
96-97 | Index 1 |
p. 140-153 |
artikel |
|
| 2041 | On dominating sets whose induced subgraphs have a bounded diameter |
Schaudt, Oliver |
2013 |
96-97 | Index 1 |
p. 2647-2652 6 p. |
artikel |
|
| 2042 | On domination game stable graphs and domination game edge-critical graphs |
Xu, Kexiang |
2018 |
96-97 | Index 1 |
p. 47-56 |
artikel |
|
| 2043 | On domination number and distance in graphs |
Kang, Cong X. |
2016 |
96-97 | Index 1 |
p. 203-206 4 p. |
artikel |
|
| 2044 | On dynamic coloring for planar graphs and graphs of higher genus |
Chen, Ye |
2012 |
96-97 | Index 1 |
p. 1064-1071 8 p. |
artikel |
|
| 2045 | On easy and hard hereditary classes of graphs with respect to the independent set problem |
Alekseev, Vladimir E. |
2003 |
96-97 | Index 1 |
p. 17-26 10 p. |
artikel |
|
| 2046 | On eccentric distance sum and minimum degree |
Mukungunugwa, Vivian |
2014 |
96-97 | Index 1 |
p. 55-61 7 p. |
artikel |
|
| 2047 | On efficient domination for some classes of H -free chordal graphs |
Brandstädt, Andreas |
|
96-97 | Index 1 |
p. 81-95 |
artikel |
|
| 2048 | On encodings of spanning trees |
Hurlbert, Glenn H. |
2007 |
96-97 | Index 1 |
p. 2594-2600 7 p. |
artikel |
|
| 2049 | On energy and Laplacian energy of chain graphs |
Das, Kinkar Chandra |
|
96-97 | Index 1 |
p. 391-400 |
artikel |
|
| 2050 | One pile misère bounded Nim with two alliances |
Zhao, Xiao |
2016 |
96-97 | Index 1 |
p. 16-33 18 p. |
artikel |
|
| 2051 | On equienergetic signed graphs |
Bhat, Mushtaq A. |
2015 |
96-97 | Index 1 |
p. 1-7 7 p. |
artikel |
|
| 2052 | On error-tolerant DNA screening |
Wu, Weili |
2006 |
96-97 | Index 1 |
p. 1753-1758 6 p. |
artikel |
|
| 2053 | One-to-many node-disjoint paths in ( n , k ) -star graphs |
Xiang, Yonghong |
2010 |
96-97 | Index 1 |
p. 62-70 9 p. |
artikel |
|
| 2054 | On exact blockers and anti-blockers, Δ -conjecture, and related problems |
Gurvich, Vladimir |
2011 |
96-97 | Index 1 |
p. 311-321 11 p. |
artikel |
|
| 2055 | On exponential type sequences |
Xue, Fang-Gang |
|
96-97 | Index 1 |
p. 187-189 |
artikel |
|
| 2056 | On extremal multiplicative Zagreb indices of trees with given number of vertices of maximum degree |
Wang, Shaohui |
2017 |
96-97 | Index 1 |
p. 166-173 |
artikel |
|
| 2057 | On extremal unicyclic molecular graphs with maximal Hosoya index |
Ou, Jianping |
2009 |
96-97 | Index 1 |
p. 391-397 7 p. |
artikel |
|
| 2058 | On extremal values of some degree-based topological indices with a forbidden or a prescribed subgraph |
Gerbner, Dániel |
|
96-97 | Index 1 |
p. 459-466 |
artikel |
|
| 2059 | On fairness of D 0 L systems |
Černý, Anton |
2007 |
96-97 | Index 1 |
p. 1769-1773 5 p. |
artikel |
|
| 2060 | On finding a large number of 3D points with a small diameter |
Jiang, Minghui |
2007 |
96-97 | Index 1 |
p. 2355-2361 7 p. |
artikel |
|
| 2061 | On finding most uniform spanning trees |
Galil, Zvi |
1988 |
96-97 | Index 1 |
p. 173-175 3 p. |
artikel |
|
| 2062 | On forcibly k -connected and forcibly k -arc-connected digraphic sequences |
Liu, Xuemei |
|
96-97 | Index 1 |
p. 10-18 |
artikel |
|
| 2063 | On forwarding indices of networks |
Heydemann, M.C. |
1989 |
96-97 | Index 1 |
p. 103-123 21 p. |
artikel |
|
| 2064 | On fractional cut covers |
Neto, José |
2019 |
96-97 | Index 1 |
p. 168-181 |
artikel |
|
| 2065 | On full friendly index sets of 1-level and 2-levels N-grids |
Gao, Zhen-Bin |
2016 |
96-97 | Index 1 |
p. 68-78 11 p. |
artikel |
|
| 2066 | On gap-labellings of some families of graphs |
Weffort-Santos, C.A. |
|
96-97 | Index 1 |
p. 296-314 |
artikel |
|
| 2067 | On general A B C -type index of connected graphs |
Chen, Chaohui |
|
96-97 | Index 1 |
p. 27-35 |
artikel |
|
| 2068 | On generalized Vietoris’ number sequences |
Cação, Isabel |
2019 |
96-97 | Index 1 |
p. 77-85 |
artikel |
|
| 2069 | On g -good-neighbor conditional connectivity and diagnosability of hierarchical star networks |
Liu, Aixia |
|
96-97 | Index 1 |
p. 95-113 |
artikel |
|
| 2070 | On graph Laplacian eigenvectors with components in { − 1 , 0 , 1 } |
Caputo, J.-G. |
2019 |
96-97 | Index 1 |
p. 120-129 |
artikel |
|
| 2071 | On graphs determining links with maximal number of components via medial construction |
Jin, Xian’an |
2009 |
96-97 | Index 1 |
p. 3099-3110 12 p. |
artikel |
|
| 2072 | On graphs maximizing the zero forcing number |
Liang, Yi-Ping |
|
96-97 | Index 1 |
p. 81-90 |
artikel |
|
| 2073 | On graphs of defect at most 2 |
Feria-Purón, Ramiro |
2011 |
96-97 | Index 1 |
p. 1331-1344 14 p. |
artikel |
|
| 2074 | On graphs on n vertices having an identifying code of cardinality ⌈ log 2 ( n + 1 ) ⌉ |
Moncel, Julien |
2006 |
96-97 | Index 1 |
p. 2032-2039 8 p. |
artikel |
|
| 2075 | On graphs that contain exactly k copies of a subgraph, and a related problem in search theory |
Gerbner, Dániel |
|
96-97 | Index 1 |
p. 196-203 |
artikel |
|
| 2076 | On graphs uniquely defined by their K -circular matroids |
De Jesús, José F. |
2017 |
96-97 | Index 1 |
p. 474-487 14 p. |
artikel |
|
| 2077 | On graphs with the maximum edge metric dimension |
Zhu, Enqiang |
2019 |
96-97 | Index 1 |
p. 317-324 |
artikel |
|
| 2078 | On group-valued potential differences and flows in a signed graph |
Ren, Xiangyu |
|
96-97 | Index 1 |
p. 185-192 |
artikel |
|
| 2079 | On hamiltonian colorings for some graphs |
Shen, Yufa |
2008 |
96-97 | Index 1 |
p. 3028-3034 |
artikel |
|
| 2080 | On Hamiltonicity of regular graphs with bounded second neighborhoods |
Asratian, Armen S. |
|
96-97 | Index 1 |
p. 75-86 |
artikel |
|
| 2081 | On hypercube labellings and antipodal monochromatic paths |
Feder, Tomás |
2013 |
96-97 | Index 1 |
p. 1421-1426 6 p. |
artikel |
|
| 2082 | On independent set in B 1 -EPG graphs |
Bessy, Stephane |
|
96-97 | Index 1 |
p. 62-72 |
artikel |
|
| 2083 | On indicated coloring of lexicographic product of graphs |
Francis, P. |
|
96-97 | Index 1 |
p. 576-582 |
artikel |
|
| 2084 | On inertia and ratio type bounds for the k -independence number of a graph and their relationship |
Abiad, Aida |
|
96-97 | Index 1 |
p. 96-109 |
artikel |
|
| 2085 | On infinite words generated by polynomial D0L systems |
Honkala, Juha |
2002 |
96-97 | Index 1 |
p. 297-305 9 p. |
artikel |
|
| 2086 | On injective edge-coloring of graphs with maximum degree 4 |
Fu, Jiacong |
|
96-97 | Index 1 |
p. 119-130 |
artikel |
|
| 2087 | On intersecting families of independent sets in trees |
Hurlbert, Glenn |
|
96-97 | Index 1 |
p. 4-9 |
artikel |
|
| 2088 | On interval colouring reorientation number of oriented graphs |
Borowiecka-Olszewska, Marta |
|
96-97 | Index 1 |
p. 65-80 |
artikel |
|
| 2089 | On intervalizing k-colored graphs for DNA physical mapping |
Bodlaender, Hans L. |
1996 |
96-97 | Index 1 |
p. 55-77 23 p. |
artikel |
|
| 2090 | On island sequences of labelings with a condition at distance two |
Adams, Sarah Spence |
2010 |
96-97 | Index 1 |
p. 1-7 7 p. |
artikel |
|
| 2091 | On k -bend and monotonic ℓ -bend edge intersection graphs of paths on a grid |
Çela, Eranda |
|
96-97 | Index 1 |
p. 88-103 |
artikel |
|
| 2092 | On k -domination and j -independence in graphs |
Hansberg, Adriana |
2013 |
96-97 | Index 1 |
p. 1472-1480 9 p. |
artikel |
|
| 2093 | On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids |
Todd, Michael J. |
2007 |
96-97 | Index 1 |
p. 1731-1744 14 p. |
artikel |
|
| 2094 | On ( 2 , k ) -Hamilton-connected graphs |
Dai, Tianjiao |
|
96-97 | Index 1 |
p. 288-299 |
artikel |
|
| 2095 | On k nearest points of a finite set in a normed linear space |
Alvoni, Elisabetta |
2004 |
96-97 | Index 1 |
p. 23-30 8 p. |
artikel |
|
| 2096 | On k-partitioning of Hamming graphs |
Bezrukov, S.L. |
1999 |
96-97 | Index 1 |
p. 127-140 14 p. |
artikel |
|
| 2097 | On k-planar crossing numbers |
Shahrokhi, Farhad |
2007 |
96-97 | Index 1 |
p. 1106-1115 10 p. |
artikel |
|
| 2098 | On k -shifted antimagic spider forests |
Chang, Fei-Huang |
|
96-97 | Index 1 |
p. 468-476 |
artikel |
|
| 2099 | On α -labellings of lobsters and trees with a perfect matching |
Luiz, Atílio G. |
2019 |
96-97 | Index 1 |
p. 137-151 |
artikel |
|
| 2100 | On Lagrangian relaxation for constrained maximization and reoptimization problems |
Kulik, Ariel |
|
96-97 | Index 1 |
p. 164-178 |
artikel |
|
| 2101 | On large regular ( 1 , 1 , k ) -mixed graphs |
Dalfó, C. |
|
96-97 | Index 1 |
p. 209-228 |
artikel |
|
| 2102 | On L ( 2 , 1 ) -coloring split, chordal bipartite, and weakly chordal graphs |
Cerioli, Márcia R. |
2012 |
96-97 | Index 1 |
p. 2655-2661 7 p. |
artikel |
|
| 2103 | On L ( d , 1 ) -labeling of Cartesian product of a cycle and a path |
Chiang, Shih-Hu |
2008 |
96-97 | Index 1 |
p. 2867-2881 |
artikel |
|
| 2104 | On leaky forcing and resilience |
Alameda, Joseph S. |
|
96-97 | Index 1 |
p. 32-45 |
artikel |
|
| 2105 | Online algorithms for a dual version of bin packing |
Csirik, J. |
1988 |
96-97 | Index 1 |
p. 163-167 5 p. |
artikel |
|
| 2106 | On-line algorithms for ordered sets and comparability graphs |
Penrice, Stephen G. |
1995 |
96-97 | Index 1 |
p. 319-329 11 p. |
artikel |
|
| 2107 | Online and offline packing cylinders in a cylindrical container |
Moqa, Rashad |
|
96-97 | Index 1 |
p. 85-104 |
artikel |
|
| 2108 | On linear and circular structure of (claw, net)-free graphs |
Brandstädt, Andreas |
2003 |
96-97 | Index 1 |
p. 285-303 19 p. |
artikel |
|
| 2109 | On linear coloring of planar graphs with small girth |
Dong, Wei |
2014 |
96-97 | Index 1 |
p. 35-44 10 p. |
artikel |
|
| 2110 | On linear-time data dissemination in dynamic rooted trees |
Zeiner, Martin |
2019 |
96-97 | Index 1 |
p. 307-319 |
artikel |
|
| 2111 | Online binary minimax trees |
Maßberg, Jens |
2013 |
96-97 | Index 1 |
p. 2556-2562 7 p. |
artikel |
|
| 2112 | Online maximum k -coverage |
Ausiello, G. |
2012 |
96-97 | Index 1 |
p. 1901-1913 13 p. |
artikel |
|
| 2113 | Online scheduling on three uniform machines |
Cai, Sheng-Yi |
2012 |
96-97 | Index 1 |
p. 291-302 12 p. |
artikel |
|
| 2114 | Online scheduling with general machine cost functions |
Imreh, Cs. |
2009 |
96-97 | Index 1 |
p. 2070-2077 8 p. |
artikel |
|
| 2115 | Online 2-stage stable matching |
Bampis, Evripidis |
|
96-97 | Index 1 |
p. 394-405 |
artikel |
|
| 2116 | Online variable-sized bin packing |
Kinnerseley, Nancy G. |
1988 |
96-97 | Index 1 |
p. 143-148 6 p. |
artikel |
|
| 2117 | On locally finite ordered rooted trees and their rooted subtrees |
Agnarsson, Geir |
|
96-97 | Index 1 |
p. 1-21 |
artikel |
|
| 2118 | On locally identifying coloring of Cartesian product and tensor product of graphs |
Bhyravarapu, Sriram |
|
96-97 | Index 1 |
p. 429-447 |
artikel |
|
| 2119 | On locating and neighbor-locating colorings of sparse graphs |
Chakraborty, Dipayan |
|
96-97 | Index 1 |
p. 366-381 |
artikel |
|
| 2120 | On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li |
Darbinyan, S.Kh. |
2017 |
96-97 | Index 1 |
p. 537-549 13 p. |
artikel |
|
| 2121 | On matroid parity and matching polytopes |
Kaparis, Konstantinos |
|
96-97 | Index 1 |
p. 322-331 |
artikel |
|
| 2122 | On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs |
Alcón, L. |
2010 |
96-97 | Index 1 |
p. 1279-1285 7 p. |
artikel |
|
| 2123 | On maximum induced forests of the balanced bipartite graphs |
Ghalavand, Ali |
|
96-97 | Index 1 |
p. 1-6 |
artikel |
|
| 2124 | On maximum k -edge-colorable subgraphs of bipartite graphs |
Karapetyan, Liana |
2019 |
96-97 | Index 1 |
p. 226-232 |
artikel |
|
| 2125 | On mean distance and girth |
Bekkai, Siham |
2010 |
96-97 | Index 1 |
p. 1888-1893 6 p. |
artikel |
|
| 2126 | On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks |
Jordán, Tibor |
2003 |
96-97 | Index 1 |
p. 421-432 12 p. |
artikel |
|
| 2127 | On minimally rainbow k -connected graphs |
Schiermeyer, Ingo |
2013 |
96-97 | Index 1 |
p. 702-705 4 p. |
artikel |
|
| 2128 | On minimal Sturmian partial words |
Blanchet-Sadri, F. |
2011 |
96-97 | Index 1 |
p. 733-745 13 p. |
artikel |
|
| 2129 | On minimal vertex separators of dually chordal graphs: Properties and characterizations |
De Caria, Pablo |
2012 |
96-97 | Index 1 |
p. 2627-2635 9 p. |
artikel |
|
| 2130 | On minimizing the maximum color for the 1–2–3 Conjecture |
Bensmail, Julien |
|
96-97 | Index 1 |
p. 32-51 |
artikel |
|
| 2131 | On minimizing the number of ADMs in a general topology optical network |
Flammini, Michele |
2009 |
96-97 | Index 1 |
p. 2701-2717 17 p. |
artikel |
|
| 2132 | On minimizing width in linear layouts |
Makedon, Fillia |
1989 |
96-97 | Index 1 |
p. 243-265 23 p. |
artikel |
|
| 2133 | On minimum degree, leaf number, traceability and Hamiltonicity in graphs |
Mafuta, P. |
2017 |
96-97 | Index 1 |
p. 89-94 6 p. |
artikel |
|
| 2134 | On Minimum Reload Cost Cycle Cover |
Galbiati, Giulia |
2014 |
96-97 | Index 1 |
p. 112-120 9 p. |
artikel |
|
| 2135 | On monochromatic component size for improper colourings |
Edwards, Keith |
2005 |
96-97 | Index 1 |
p. 89-105 17 p. |
artikel |
|
| 2136 | On monotone functions of tree structures |
Prodinger, Helmut |
1983 |
96-97 | Index 1 |
p. 223-239 17 p. |
artikel |
|
| 2137 | On monotonicity in Maker–Breaker graph colouring games |
Hollom, Lawrence |
|
96-97 | Index 1 |
p. 131-138 |
artikel |
|
| 2138 | On morphic generation of regular languages |
Harju, T. |
1986 |
96-97 | Index 1 |
p. 55-60 6 p. |
artikel |
|
| 2139 | On multicolour noncomplete Ramsey graphs of star graphs |
Gautam, Sachin |
2008 |
96-97 | Index 1 |
p. 2423-2428 6 p. |
artikel |
|
| 2140 | On n -fold L ( j , k ) -and circular L ( j , k ) -labelings of graphs |
Lin, Wensong |
2012 |
96-97 | Index 1 |
p. 2452-2461 10 p. |
artikel |
|
| 2141 | On ( n , m ) -chromatic numbers of graphs with bounded sparsity parameters |
Das, Sandip |
|
96-97 | Index 1 |
p. 417-428 |
artikel |
|
| 2142 | On nonrepetitive colorings of paths and cycles |
Botler, Fábio |
|
96-97 | Index 1 |
p. 221-228 |
artikel |
|
| 2143 | On non-repetitive sequences of arithmetic progressions: The cases k ∈ { 4 , 5 , 6 , 7 , 8 } |
Lužar, Borut |
|
96-97 | Index 1 |
p. 106-117 |
artikel |
|
| 2144 | On null 3-hypergraphs |
Frosini, Andrea |
|
96-97 | Index 1 |
p. 76-85 |
artikel |
|
| 2145 | On offset Hamilton cycles in random hypergraphs |
Dudek, Andrzej |
2018 |
96-97 | Index 1 |
p. 77-85 |
artikel |
|
| 2146 | On optimal approximability results for computing the strong metric dimension |
DasGupta, Bhaskar |
2017 |
96-97 | Index 1 |
p. 18-24 7 p. |
artikel |
|
| 2147 | On optimal broadcasting in faulty hypercubes |
Bruck, Jehoshua |
1994 |
96-97 | Index 1 |
p. 3-13 11 p. |
artikel |
|
| 2148 | On optimally- λ ( 3 ) transitive graphs |
Zhang, Zhao |
2006 |
96-97 | Index 1 |
p. 1011-1018 8 p. |
artikel |
|
| 2149 | On optimal strategies for a betting game |
Yang, Zhuocheng |
1990 |
96-97 | Index 1 |
p. 157-169 13 p. |
artikel |
|
| 2150 | On oriented diameter of ( n , k ) -star graphs |
Ajish Kumar, K.S. |
|
96-97 | Index 1 |
p. 214-228 |
artikel |
|
| 2151 | On orthogonal ray graphs |
Shrestha, Anish Man Singh |
2010 |
96-97 | Index 1 |
p. 1650-1659 10 p. |
artikel |
|
| 2152 | On packing and coloring hyperedges in a cycle |
Li, Jianping |
2007 |
96-97 | Index 1 |
p. 2140-2151 12 p. |
artikel |
|
| 2153 | On packing colorings of distance graphs |
Togni, Olivier |
2014 |
96-97 | Index 1 |
p. 280-289 10 p. |
artikel |
|
| 2154 | On packing S -colorings of subcubic graphs |
Yang, Wei |
|
96-97 | Index 1 |
p. 1-14 |
artikel |
|
| 2155 | On partial Grundy coloring of bipartite graphs and chordal graphs |
Panda, B.S. |
2019 |
96-97 | Index 1 |
p. 171-183 |
artikel |
|
| 2156 | On partitioning minimum spanning trees |
Guttmann-Beck, Nili |
|
96-97 | Index 1 |
p. 45-54 |
artikel |
|
| 2157 | On partitions of graphs under degree constraints |
Liu, Muhuo |
2017 |
96-97 | Index 1 |
p. 87-93 7 p. |
artikel |
|
| 2158 | On partitions with k corners not containing the staircase with one more corner |
Briand, Emmanuel |
|
96-97 | Index 1 |
p. 162-168 |
artikel |
|
| 2159 | On paths with the shortest average arc length in weighted graphs |
Wimer, Shmuel |
1993 |
96-97 | Index 1 |
p. 169-179 11 p. |
artikel |
|
| 2160 | On polygon numbers of circle graphs and distance hereditary graphs |
Stewart, Lorna |
2018 |
96-97 | Index 1 |
p. 3-17 |
artikel |
|
| 2161 | On polyhedra induced by point sets in space |
Agarwal, Pankaj K. |
2008 |
96-97 | Index 1 |
p. 42-54 13 p. |
artikel |
|
| 2162 | On polynomial time inflation algorithm for loop-free non-negative edge-bipartite graphs |
Zając, Katarzyna |
|
96-97 | Index 1 |
p. 28-43 |
artikel |
|
| 2163 | On positive and negative atoms of Cayley digraphs |
Zemor, Gilles |
1989 |
96-97 | Index 1 |
p. 193-195 3 p. |
artikel |
|
| 2164 | On powers of graphs of bounded NLC-width (clique-width) |
Suchan, Karol |
2007 |
96-97 | Index 1 |
p. 1885-1893 9 p. |
artikel |
|
| 2165 | On powers of m-trapezoid graphs |
Flotow, Carsten |
1995 |
96-97 | Index 1 |
p. 187-192 6 p. |
artikel |
|
| 2166 | On pseudo 2-factors |
Bekkai, Siham |
2009 |
96-97 | Index 1 |
p. 774-779 6 p. |
artikel |
|
| 2167 | On (q, 1)-subnormal q-ary covering codes |
Honkala, Iiro |
1994 |
96-97 | Index 1 |
p. 213-221 9 p. |
artikel |
|
| 2168 | On quasi-monotonous graphs |
Kouider, Mekkia |
2016 |
96-97 | Index 1 |
p. 155-163 9 p. |
artikel |
|
| 2169 | On quasi-planar graphs: Clique-width and logical description |
Courcelle, Bruno |
|
96-97 | Index 1 |
p. 118-135 |
artikel |
|
| 2170 | On r -acyclic edge colorings of planar graphs |
Zhang, Xin |
2012 |
96-97 | Index 1 |
p. 2048-2053 6 p. |
artikel |
|
| 2171 | On 2-rainbow domination of generalized Petersen graphs |
Shao, Zehui |
2019 |
96-97 | Index 1 |
p. 370-384 |
artikel |
|
| 2172 | On rainbow total-coloring of a graph |
Sun, Yuefang |
2015 |
96-97 | Index 1 |
p. 171-177 7 p. |
artikel |
|
| 2173 | On Ramsey and star-critical Ramsey numbers for generalized fans versus n K m |
Hamm, Arran |
|
96-97 | Index 1 |
p. 64-70 |
artikel |
|
| 2174 | On Ramsey numbers of complete graphs with dropped stars |
Chappelon, Jonathan |
2016 |
96-97 | Index 1 |
p. 200-206 |
artikel |
|
| 2175 | On Ramsey numbers of fans |
Lin, Qizhong |
2009 |
96-97 | Index 1 |
p. 191-194 4 p. |
artikel |
|
| 2176 | On randomized algorithms for the majority problem |
Christofides, Demetres |
2009 |
96-97 | Index 1 |
p. 1481-1485 5 p. |
artikel |
|
| 2177 | On randomized broadcasting in Star graphs |
Elsässer, R. |
2009 |
96-97 | Index 1 |
p. 126-139 14 p. |
artikel |
|
| 2178 | On random multi-dimensional assignment problems |
Frieze, Alan |
|
96-97 | Index 1 |
p. 1-9 |
artikel |
|
| 2179 | On 1-rate wide-sense nonblocking for 3-stage Clos networks |
Fishburn, Peter |
1997 |
96-97 | Index 1 |
p. 75-87 13 p. |
artikel |
|
| 2180 | On r -dynamic coloring of graphs |
Jahanbekam, Sogol |
2016 |
96-97 | Index 1 |
p. 65-72 8 p. |
artikel |
|
| 2181 | On real number labelings and graph invertibility |
Choi, Jeong-Ok |
2012 |
96-97 | Index 1 |
p. 2116-2130 15 p. |
artikel |
|
| 2182 | On reformulated Zagreb indices |
Ilić, Aleksandar |
2012 |
96-97 | Index 1 |
p. 204-209 6 p. |
artikel |
|
| 2183 | On regularity of languages generated by copying systems |
Ehrenfeucht, A. |
1984 |
96-97 | Index 1 |
p. 313-317 5 p. |
artikel |
|
| 2184 | On regular 2-path Hamiltonian graphs |
Li, Xia |
|
96-97 | Index 1 |
p. 61-70 |
artikel |
|
| 2185 | On relationship between Hamiltonian path and holes in L ( 3 , 2 , 1 ) -coloring of minimum span |
Sarkar, Ushnish |
2017 |
96-97 | Index 1 |
p. 227-234 8 p. |
artikel |
|
| 2186 | On reliable graphs with static routing plans |
Poguntke, Werner |
1994 |
96-97 | Index 1 |
p. 137-146 10 p. |
artikel |
|
| 2187 | On r -equitable chromatic threshold of Kronecker products of complete graphs |
Wang, Wei |
2014 |
96-97 | Index 1 |
p. 129-134 6 p. |
artikel |
|
| 2188 | On r -hued list coloring of K 4 ( 7 ) -minor free graphs |
Wei, Wenjuan |
|
96-97 | Index 1 |
p. 301-309 |
artikel |
|
| 2189 | On r -uniform hypergraphs with circumference less than r |
Kostochka, Alexandr |
|
96-97 | Index 1 |
p. 69-91 |
artikel |
|
| 2190 | On saturated non-covered graphs |
Zhou, Jinqiu |
|
96-97 | Index 1 |
p. 53-59 |
artikel |
|
| 2191 | On sequential diagnosis of multiprocessor systems |
Yamada, T. |
2005 |
96-97 | Index 1 |
p. 311-342 32 p. |
artikel |
|
| 2192 | On set expansion problems and the small set expansion conjecture |
Gandhi, Rajiv |
2015 |
96-97 | Index 1 |
p. 93-101 9 p. |
artikel |
|
| 2193 | On shortening u-cycles and u-words for permutations |
Kitaev, Sergey |
2019 |
96-97 | Index 1 |
p. 203-213 |
artikel |
|
| 2194 | On shortest crucial words avoiding abelian powers |
Avgustinovich, Sergey |
2010 |
96-97 | Index 1 |
p. 605-607 3 p. |
artikel |
|
| 2195 | On signed digraphs with all cycles negative |
Harary, Frank |
1985 |
96-97 | Index 1 |
p. 155-164 10 p. |
artikel |
|
| 2196 | On signed digraphs with all cycles negative |
Chaty, Guy |
1988 |
96-97 | Index 1 |
p. 83-85 3 p. |
artikel |
|
| 2197 | On some difficult linear programs coming from set partitioning |
Barahona, Francisco |
2002 |
96-97 | Index 1 |
p. 3-11 9 p. |
artikel |
|
| 2198 | On some geometric methods in scheduling theory: a survey |
Sevast'janov, S.V. |
1994 |
96-97 | Index 1 |
p. 59-82 24 p. |
artikel |
|
| 2199 | On some open problems concerning quorum colorings of graphs |
Sahbi, Rafik |
|
96-97 | Index 1 |
p. 294-299 |
artikel |
|
| 2200 | On some three-color Ramsey numbers for paths |
Dybizbański, Janusz |
2016 |
96-97 | Index 1 |
p. 133-141 9 p. |
artikel |
|
| 2201 | On some topological indices of the tensor products of graphs |
Pattabiraman, K. |
2012 |
96-97 | Index 1 |
p. 267-279 13 p. |
artikel |
|
| 2202 | On S -packing edge-colorings of cubic graphs |
Gastineau, Nicolas |
2019 |
96-97 | Index 1 |
p. 63-75 |
artikel |
|
| 2203 | On spanning galaxies in digraphs |
Gonçalves, Daniel |
2012 |
96-97 | Index 1 |
p. 744-754 11 p. |
artikel |
|
| 2204 | On spanning subgraphs of 4-connected planar graphs |
Rosenfeld, Moshe |
1989 |
96-97 | Index 1 |
p. 279-287 9 p. |
artikel |
|
| 2205 | On spanning 2-trees in a graph |
Cai, Leizhen |
1997 |
96-97 | Index 1 |
p. 203-216 14 p. |
artikel |
|
| 2206 | On specifying Boolean functions by labelled examples |
Anthony, Martin |
1995 |
96-97 | Index 1 |
p. 1-25 25 p. |
artikel |
|
| 2207 | On spectral extrema of graphs with given order and dissociation number |
Huang, Jing |
|
96-97 | Index 1 |
p. 368-380 |
artikel |
|
| 2208 | On spectral invariants of the α -mixed adjacency matrix |
Andrade, Enide |
|
96-97 | Index 1 |
p. 300-327 |
artikel |
|
| 2209 | On spectral radius of generalized arithmetic–geometric matrix of connected graphs and its applications |
Chen, Xiaodan |
|
96-97 | Index 1 |
p. 1-12 |
artikel |
|
| 2210 | On Spieß’s conjecture on harmonic numbers |
Jin, Hai-Tao |
2013 |
96-97 | Index 1 |
p. 2038-2041 4 p. |
artikel |
|
| 2211 | On split graphs with four distinct eigenvalues |
Goldberg, Felix |
|
96-97 | Index 1 |
p. 163-171 |
artikel |
|
| 2212 | On stable cutsets in graphs |
Brandstädt, Andreas |
2000 |
96-97 | Index 1 |
p. 39-50 12 p. |
artikel |
|
| 2213 | On star-critical and upper size Ramsey numbers |
Zhang, Yanbo |
2016 |
96-97 | Index 1 |
p. 174-180 7 p. |
artikel |
|
| 2214 | On star edge colorings of bipartite and subcubic graphs |
Casselgren, Carl Johan |
|
96-97 | Index 1 |
p. 21-33 |
artikel |
|
| 2215 | On ( 1 , 2 ) -step competition graphs of bipartite tournaments |
Choi, Jihoon |
2017 |
96-97 | Index 1 |
p. 107-115 |
artikel |
|
| 2216 | On strong edge-coloring of graphs with maximum degree 5 |
Lu, Jian |
|
96-97 | Index 1 |
p. 120-128 |
artikel |
|
| 2217 | On strongly asymmetric and controllable primitive graphs |
Farrugia, Alexander |
2016 |
96-97 | Index 1 |
p. 58-67 10 p. |
artikel |
|
| 2218 | On strongly Z 2 s + 1 -connected graphs |
Lai, Hong-Jian |
2014 |
96-97 | Index 1 |
p. 73-80 8 p. |
artikel |
|
| 2219 | On strong unimodality of multivariate discrete distributions |
Subasi, Ersoy |
2009 |
96-97 | Index 1 |
p. 234-246 13 p. |
artikel |
|
| 2220 | On structural properties of trees with minimal atom-bond connectivity index II: Bounds on B 1 - and B 2 -branches |
Dimitrov, Darko |
2016 |
96-97 | Index 1 |
p. 90-116 27 p. |
artikel |
|
| 2221 | On subclasses of interval count two and on Fishburn’s conjecture |
Francis, Mathew C. |
|
96-97 | Index 1 |
p. 236-251 |
artikel |
|
| 2222 | On subword complexity functions |
Sajo, Anni |
1984 |
96-97 | Index 1 |
p. 209-212 4 p. |
artikel |
|
| 2223 | On subwords of infinite words |
Ilie, Lucian |
1995 |
96-97 | Index 1 |
p. 277-279 3 p. |
artikel |
|
| 2224 | On sum edge-coloring of regular, bipartite and split graphs |
Petrosyan, P.A. |
2014 |
96-97 | Index 1 |
p. 263-269 7 p. |
artikel |
|
| 2225 | On sum of powers of normalized Laplacian eigenvalues and resistance distances of graphs |
Sun, Wenwen |
|
96-97 | Index 1 |
p. 179-186 |
artikel |
|
| 2226 | On testing consecutive-ones property in parallel |
Annexstein, Fred |
1998 |
96-97 | Index 1 |
p. 7-28 22 p. |
artikel |
|
| 2227 | On the absolute and relative oriented clique problems’ time complexity |
Coelho, E.M.M. |
|
96-97 | Index 1 |
p. 53-65 |
artikel |
|
| 2228 | On the acyclic disconnection and the girth |
Balbuena, Camino |
2015 |
96-97 | Index 1 |
p. 13-18 6 p. |
artikel |
|
| 2229 | On the additive complexity of a Thue–Morse-like sequence |
Chen, Jin |
2019 |
96-97 | Index 1 |
p. 98-108 |
artikel |
|
| 2230 | On the A α -index of graphs with given order and dissociation number |
Zhou, Zihan |
|
96-97 | Index 1 |
p. 167-180 |
artikel |
|
| 2231 | On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs |
Dehghan, Ali |
2017 |
96-97 | Index 1 |
p. 82-97 16 p. |
artikel |
|
| 2232 | On the anti-Kekulé number and odd cycle transversal of regular graphs |
Ye, Dong |
2013 |
96-97 | Index 1 |
p. 2196-2199 4 p. |
artikel |
|
| 2233 | On the approximability and exact algorithms for vector domination and related problems in graphs |
Cicalese, Ferdinando |
2013 |
96-97 | Index 1 |
p. 750-767 18 p. |
artikel |
|
| 2234 | On the approximability of average completion time scheduling under precedence constraints |
Woeginger, Gerhard J |
2003 |
96-97 | Index 1 |
p. 237-252 16 p. |
artikel |
|
| 2235 | On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems |
Guillemot, Sylvain |
2009 |
96-97 | Index 1 |
p. 1555-1570 16 p. |
artikel |
|
| 2236 | On the A α -spectral radius of graphs with given size |
Chen, Hongzhang |
|
96-97 | Index 1 |
p. 350-362 |
artikel |
|
| 2237 | On the asymmetric representatives formulation for the vertex coloring problem |
Campêlo, Manoel |
2008 |
96-97 | Index 1 |
p. 1097-1111 15 p. |
artikel |
|
| 2238 | On the asymptotic existence of partial complex Hadamard matrices and related combinatorial objects |
de Launey, Warwick |
2000 |
96-97 | Index 1 |
p. 37-45 9 p. |
artikel |
|
| 2239 | On the asymptotics of the number of binary words with a given length of a maximal series |
Korshunov, A.D. |
2001 |
96-97 | Index 1 |
p. 171-201 31 p. |
artikel |
|
| 2240 | On the average Hamming distance for binary codes |
Shutao, Xia |
1998 |
96-97 | Index 1 |
p. 269-276 8 p. |
artikel |
|
| 2241 | On the average hitting times of Cay ( Z N , { + 1 , + 2 } ) |
Tanaka, Yuuho |
|
96-97 | Index 1 |
p. 269-276 |
artikel |
|
| 2242 | On the average shape of monotonically labelled tree structures |
Kirschenhofer, Peter |
1984 |
96-97 | Index 1 |
p. 161-181 21 p. |
artikel |
|
| 2243 | On the bandwidth of the Kneser graph |
Jiang, Tao |
2017 |
96-97 | Index 1 |
p. 84-94 |
artikel |
|
| 2244 | On the b-chromatic number of cartesian products |
Guo, Chuan |
2018 |
96-97 | Index 1 |
p. 82-93 |
artikel |
|
| 2245 | On the b -chromatic number of regular bounded graphs |
Amine, El Sahili |
2015 |
96-97 | Index 1 |
p. 174-179 6 p. |
artikel |
|
| 2246 | On the b-chromatic number of regular graphs |
Cabello, Sergio |
2011 |
96-97 | Index 1 |
p. 1303-1310 8 p. |
artikel |
|
| 2247 | On the b -chromatic number of regular graphs without 4-cycle |
Shaebani, Saeed |
2012 |
96-97 | Index 1 |
p. 1610-1614 5 p. |
artikel |
|
| 2248 | On the b -coloring of P 4 -tidy graphs |
Velasquez, Clara Inés Betancur |
2011 |
96-97 | Index 1 |
p. 60-68 9 p. |
artikel |
|
| 2249 | On the b-dominating coloring of graphs |
Hoàng, Chính T. |
2005 |
96-97 | Index 1 |
p. 176-186 11 p. |
artikel |
|
| 2250 | On the behavior of the N + -operator under blocker duality |
Bianchi, Silvia M. |
2011 |
96-97 | Index 1 |
p. 396-399 4 p. |
artikel |
|
| 2251 | On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid |
Alcón, Liliana |
2018 |
96-97 | Index 1 |
p. 12-21 |
artikel |
|
| 2252 | On the bitprobe complexity of two probe adaptive schemes |
Kesh, Deepanjan |
|
96-97 | Index 1 |
p. 132-140 |
artikel |
|
| 2253 | On the bounds for signless Laplacian energy of a graph |
Ganie, Hilal A. |
2017 |
96-97 | Index 1 |
p. 3-13 11 p. |
artikel |
|
| 2254 | On the Bruhat order of labeled graphs |
Brualdi, Richard A. |
2019 |
96-97 | Index 1 |
p. 49-64 |
artikel |
|
| 2255 | On the characteristic polynomial of the adjacency matrix of the subdivision graph of a graph |
Shinoda, Shoji |
1980 |
96-97 | Index 1 |
p. 349-351 3 p. |
artikel |
|
| 2256 | On the characterization of some algebraically defined bipartite graphs of girth eight |
Xu, Ming |
|
96-97 | Index 1 |
p. 221-232 |
artikel |
|
| 2257 | On the characterization of the domination of a diameter-constrained network reliability model |
Cancela, Héctor |
2006 |
96-97 | Index 1 |
p. 1885-1896 12 p. |
artikel |
|
| 2258 | On the chromatic forcing number of a random graph |
McDiarmid, Colin |
1983 |
96-97 | Index 1 |
p. 123-132 10 p. |
artikel |
|
| 2259 | On the chromatic number, colorings, and codes of the Johnson graph |
Etzion, Tuvi |
1996 |
96-97 | Index 1 |
p. 163-175 13 p. |
artikel |
|
| 2260 | On the chromatic number of graphs of odd girth without longer odd holes |
Wang, Hongyang |
|
96-97 | Index 1 |
p. 227-230 |
artikel |
|
| 2261 | On the chromatic number of 2 K 2 -free graphs |
Brause, Christoph |
2019 |
96-97 | Index 1 |
p. 14-24 |
artikel |
|
| 2262 | On the chromatic number of random subgraphs of a certain distance graph |
Pyaderkin, M.M. |
2019 |
96-97 | Index 1 |
p. 209-214 |
artikel |
|
| 2263 | On the chromatic number of Toeplitz graphs |
Nicoloso, Sara |
2014 |
96-97 | Index 1 |
p. 286-296 11 p. |
artikel |
|
| 2264 | On the chromatic numbers of small-dimensional Euclidean spaces |
Cherkashin, Danila |
2018 |
96-97 | Index 1 |
p. 125-131 |
artikel |
|
| 2265 | On the classification and dispersability of circulant graphs with two jump lengths |
Yu, Xiaoxiang |
|
96-97 | Index 1 |
p. 268-286 |
artikel |
|
| 2266 | On the clique-width of ( 4 K 1 , C 4 , C 5 , C 7 ) -free graphs |
Penev, Irena |
|
96-97 | Index 1 |
p. 688-690 |
artikel |
|
| 2267 | On the Colijn–Plazzotta numbering scheme for unlabeled binary rooted trees |
Rosenberg, Noah A. |
|
96-97 | Index 1 |
p. 88-98 |
artikel |
|
| 2268 | On the combinatorial structure of a class of [ m 2 , m − 1 2 , 3 ] shortened Hamming codes and their dual-codes |
Esmaeili, M. |
2009 |
96-97 | Index 1 |
p. 356-363 8 p. |
artikel |
|
| 2269 | On the commutativity of antiblocker diagrams under lift-and-project operators |
Escalante, M. |
2006 |
96-97 | Index 1 |
p. 1845-1853 9 p. |
artikel |
|
| 2270 | On the competition graphs of d -partial orders |
Choi, Jihoon |
2016 |
96-97 | Index 1 |
p. 29-37 9 p. |
artikel |
|
| 2271 | On the complexity of cd-coloring of graphs |
M.A., Shalu |
|
96-97 | Index 1 |
p. 171-185 |
artikel |
|
| 2272 | On the complexity of comparing evolutionary trees |
Hein, Jotun |
1996 |
96-97 | Index 1 |
p. 153-169 17 p. |
artikel |
|
| 2273 | On the complexity of computing treelength |
Lokshtanov, Daniel |
2010 |
96-97 | Index 1 |
p. 820-827 8 p. |
artikel |
|
| 2274 | On the complexity of constrained VC-classes |
Ratsaby, Joel |
2008 |
96-97 | Index 1 |
p. 903-910 8 p. |
artikel |
|
| 2275 | On the complexity of k -rainbow cycle colouring problems |
Li, Shasha |
2019 |
96-97 | Index 1 |
p. 125-133 |
artikel |
|
| 2276 | On the complexity of postoptimality analysis of 0 1 programs |
Van Hoesel, Stan |
1999 |
96-97 | Index 1 |
p. 251-263 13 p. |
artikel |
|
| 2277 | On the complexity of some edge-partition problems for graphs |
Lonc, Zbigniew |
1996 |
96-97 | Index 1 |
p. 177-183 7 p. |
artikel |
|
| 2278 | On the complexity of suboptimal decoding for list and decision feedback schemes |
Freudenberger, J. |
2006 |
96-97 | Index 1 |
p. 294-304 11 p. |
artikel |
|
| 2279 | On the complexity of the embedding problem for hypercube related graphs |
Wagner, A. |
1993 |
96-97 | Index 1 |
p. 75-95 21 p. |
artikel |
|
| 2280 | On the complexity of the flow coloring problem |
Campêlo, Manoel |
2015 |
96-97 | Index 1 |
p. 75-92 18 p. |
artikel |
|
| 2281 | On the complexity of the identifiable subgraph problem |
Kamiński, Marcin |
2015 |
96-97 | Index 1 |
p. 25-33 9 p. |
artikel |
|
| 2282 | On the complexity of the identifiable subgraph problem, revisited |
Kratsch, Stefan |
2017 |
96-97 | Index 1 |
p. 78-86 9 p. |
artikel |
|
| 2283 | On the computational complexity of upper fractional domination |
Cheston, Grant A. |
1990 |
96-97 | Index 1 |
p. 195-207 13 p. |
artikel |
|
| 2284 | On the computational complexity of upper total domination |
Fang, Qizhi |
2004 |
96-97 | Index 1 |
p. 13-22 10 p. |
artikel |
|
| 2285 | On the conjecture of the r -uniform supertrees with the eight largest α -spectral radii |
Wang, Wen-Huan |
|
96-97 | Index 1 |
p. 311-319 |
artikel |
|
| 2286 | On the connectivity and restricted edge-connectivity of 3-arc graphs |
Balbuena, C. |
2014 |
96-97 | Index 1 |
p. 90-99 10 p. |
artikel |
|
| 2287 | On the connectivity and superconnected graphs with small diameter |
Balbuena, C. |
2010 |
96-97 | Index 1 |
p. 397-403 7 p. |
artikel |
|
| 2288 | On the connectivity of close to regular multipartite tournaments |
Volkmann, Lutz |
2006 |
96-97 | Index 1 |
p. 1437-1452 16 p. |
artikel |
|
| 2289 | On the connectivity of p -diamond-free vertex transitive graphs |
Tian, Yingzhi |
2012 |
96-97 | Index 1 |
p. 1285-1290 6 p. |
artikel |
|
| 2290 | On the consecutive ones property |
Meidanis, João |
1998 |
96-97 | Index 1 |
p. 325-354 30 p. |
artikel |
|
| 2291 | On the construction of locally most reliable two-terminal graphs |
Gong, Shi-Cai |
|
96-97 | Index 1 |
p. 393-402 |
artikel |
|
| 2292 | On the correlation of binary sequences |
Ahlswede, R. |
2008 |
96-97 | Index 1 |
p. 1478-1487 10 p. |
artikel |
|
| 2293 | On the covering radius of long binary BCH codes |
Tietäinen, A |
1987 |
96-97 | Index 1 |
p. 75-77 3 p. |
artikel |
|
| 2294 | On the crossing numbers of K m □ C n and K m , l □ P n |
Wenping, Zheng |
2008 |
96-97 | Index 1 |
p. 1892-1907 16 p. |
artikel |
|
| 2295 | On the cut-off point for combinatorial group testing |
Fischer, Paul |
1999 |
96-97 | Index 1 |
p. 83-92 10 p. |
artikel |
|
| 2296 | On the degree distance of a graph |
Dankelmann, P. |
2009 |
96-97 | Index 1 |
p. 2773-2777 5 p. |
artikel |
|
| 2297 | On the degree of homogeneous bent functions |
Meng, Qingshu |
2007 |
96-97 | Index 1 |
p. 665-669 5 p. |
artikel |
|
| 2298 | On the dependence of the maximum cycle mean of a matrix on permutations of the rows and columns |
Butkovič, Peter |
1989 |
96-97 | Index 1 |
p. 45-53 9 p. |
artikel |
|
| 2299 | On the depth of combinatorial optimization problems |
Kern, W. |
1993 |
96-97 | Index 1 |
p. 115-129 15 p. |
artikel |
|
| 2300 | On the diameter and girth of zero-divisor graphs of posets |
Alizadeh, M. |
2012 |
96-97 | Index 1 |
p. 1319-1324 6 p. |
artikel |
|
| 2301 | On the diameter of Schrijver graphs |
Ledezma, Agustina Victoria |
|
96-97 | Index 1 |
p. 15-30 |
artikel |
|
| 2302 | On the difference between the (revised) Szeged index and the Wiener index of cacti |
Klavžar, Sandi |
|
96-97 | Index 1 |
p. 77-89 |
artikel |
|
| 2303 | On the differential and Roman domination number of a graph with minimum degree two |
Bermudo, Sergio |
2017 |
96-97 | Index 1 |
p. 64-72 |
artikel |
|
| 2304 | On the dimension of projected polyhedra |
Balas, Egon |
1998 |
96-97 | Index 1 |
p. 1-9 9 p. |
artikel |
|
| 2305 | On the directionality of interval orders |
Bouchitté, Vincent |
1994 |
96-97 | Index 1 |
p. 87-92 6 p. |
artikel |
|
| 2306 | On the discrete version of Picone's identity |
Amghibech, S. |
2008 |
96-97 | Index 1 |
p. 1-10 10 p. |
artikel |
|
| 2307 | On the disc-structure of perfect graphs I the co-paw-structure |
Hoàng, Chinh T. |
1999 |
96-97 | Index 1 |
p. 247-262 16 p. |
artikel |
|
| 2308 | On the distance Laplacian spectral radius of bipartite graphs |
Niu, Aihong |
2015 |
96-97 | Index 1 |
p. 207-213 7 p. |
artikel |
|
| 2309 | On the distinguishing number of cyclic tournaments: Towards the Albertson–Collins Conjecture |
Meslem, Kahina |
2019 |
96-97 | Index 1 |
p. 219-236 |
artikel |
|
| 2310 | On the distribution of distances between specified nodes in increasing trees |
Kuba, Markus |
2010 |
96-97 | Index 1 |
p. 489-506 18 p. |
artikel |
|
| 2311 | On the dominant of the Steiner 2-edge connected subgraph polytope |
Baı̈ou, Mourad |
2001 |
96-97 | Index 1 |
p. 3-10 8 p. |
artikel |
|
| 2312 | On the domination number of permutation graphs and an application to strong fixed points |
Baren, Theresa |
|
96-97 | Index 1 |
p. 20-34 |
artikel |
|
| 2313 | On the domination number of the cartesian product of the cycle of length n and any graph |
El-Zahar, M.H. |
2007 |
96-97 | Index 1 |
p. 515-522 8 p. |
artikel |
|
| 2314 | On the double Roman domination in graphs |
Abdollahzadeh Ahangar, Hossein |
2017 |
96-97 | Index 1 |
p. 1-7 |
artikel |
|
| 2315 | On the dynamic coloring of graphs |
Alishahi, Meysam |
2011 |
96-97 | Index 1 |
p. 152-156 5 p. |
artikel |
|
| 2316 | On the edge-connectivity of the square of a graph |
Balbuena, Camino |
|
96-97 | Index 1 |
p. 250-256 |
artikel |
|
| 2317 | On the edge dimension and the fractional edge dimension of graphs |
Yi, Eunjeong |
|
96-97 | Index 1 |
p. 120-130 |
artikel |
|
| 2318 | On the embedding of cone graphs in the line with distinct distances between neighbors |
Zhou, Rodrigo M. |
2019 |
96-97 | Index 1 |
p. 157-162 |
artikel |
|
| 2319 | On the enumeration of certain weighted graphs |
Bóna, Miklós |
2007 |
96-97 | Index 1 |
p. 1481-1496 16 p. |
artikel |
|
| 2320 | On the equitable chromatic number of complete n-partite graphs |
Lam, Peter Che Bor |
2001 |
96-97 | Index 1 |
p. 307-310 4 p. |
artikel |
|
| 2321 | On the equivalence between roof duality and Lagrangian duality for unconstrained 0–1 quadratic programming problems |
Adams, Warren P. |
1994 |
96-97 | Index 1 |
p. 1-20 20 p. |
artikel |
|
| 2322 | On the equivalence of paved-duality and standard linearization in nonlinear 0–1 optimization |
Hansen, P. |
1990 |
96-97 | Index 1 |
p. 187-193 7 p. |
artikel |
|
| 2323 | On the equivalence problem of context-free and DT0L languages |
Honkala, Juha |
1999 |
96-97 | Index 1 |
p. 147-149 3 p. |
artikel |
|
| 2324 | On the Estrada index of cactus graphs |
Li, Faxu |
2016 |
96-97 | Index 1 |
p. 94-105 12 p. |
artikel |
|
| 2325 | On the event distance of Poisson processes with applications to sensors |
Kranakis, Evangelos |
2014 |
96-97 | Index 1 |
p. 152-162 11 p. |
artikel |
|
| 2326 | On the exact size of maximum impulse radio sequences with parameters ( m , k , λ , k − 1 ) |
Zhou, Junling |
2014 |
96-97 | Index 1 |
p. 122-136 15 p. |
artikel |
|
| 2327 | On the excessive [ m ] -index of a tree |
Mazzuoccolo, G. |
2014 |
96-97 | Index 1 |
p. 264-270 7 p. |
artikel |
|
| 2328 | On the existence of graphs which can colour every regular graph |
Mazzuoccolo, Giuseppe |
|
96-97 | Index 1 |
p. 246-256 |
artikel |
|
| 2329 | On the existence of retransmission permutation arrays |
Wanless, Ian M. |
2013 |
96-97 | Index 1 |
p. 2772-2777 6 p. |
artikel |
|
| 2330 | On the existence of vertex-disjoint subgraphs with high degree sum |
Chiba, Shuya |
2018 |
96-97 | Index 1 |
p. 84-95 |
artikel |
|
| 2331 | On the existence problem of the total domination vertex critical graphs |
Sohn, Moo Young |
2011 |
96-97 | Index 1 |
p. 46-52 7 p. |
artikel |
|
| 2332 | On the extremal graphs for general sum-connectivity index ( χ α ) with given cyclomatic number when α > 1 |
Ali, Akbar |
2019 |
96-97 | Index 1 |
p. 19-30 |
artikel |
|
| 2333 | On the extremal graphs with respect to bond incident degree indices |
Ali, Akbar |
2018 |
96-97 | Index 1 |
p. 32-40 |
artikel |
|
| 2334 | On the extremal maximum agreement subtree problem |
Markin, Alexey |
|
96-97 | Index 1 |
p. 612-620 |
artikel |
|
| 2335 | On the extremal sizes of maximal graphs without ( k + 1 ) -connected subgraphs |
Xu, Liqiong |
|
96-97 | Index 1 |
p. 397-406 |
artikel |
|
| 2336 | On the first geometric–arithmetic index of graphs |
Das, K.Ch. |
2011 |
96-97 | Index 1 |
p. 2030-2037 8 p. |
artikel |
|
| 2337 | On the first-order edge tenacity of a graph |
Bafandeh, Bahareh |
2016 |
96-97 | Index 1 |
p. 8-15 8 p. |
artikel |
|
| 2338 | On the fractional strong metric dimension of graphs |
Kang, Cong X. |
2016 |
96-97 | Index 1 |
p. 153-161 9 p. |
artikel |
|
| 2339 | On the game coloring index of F + -decomposable graphs |
Charpentier, Clément |
2018 |
96-97 | Index 1 |
p. 73-83 |
artikel |
|
| 2340 | On the generalized Helly property of hypergraphs, cliques, and bicliques |
Dourado, Mitre C. |
|
96-97 | Index 1 |
p. 56-77 |
artikel |
|
| 2341 | On the generalized Turán number of star forests |
Liu, Yan-Jiao |
|
96-97 | Index 1 |
p. 213-221 |
artikel |
|
| 2342 | On the General Randić index of polymeric networks modelled by generalized Sierpiński graphs |
Estrada-Moreno, Alejandro |
2019 |
96-97 | Index 1 |
p. 140-151 |
artikel |
|
| 2343 | On the general sum-connectivity index of connected unicyclic graphs with k pendant vertices |
Tomescu, Ioan |
2015 |
96-97 | Index 1 |
p. 306-309 4 p. |
artikel |
|
| 2344 | On the general sum-connectivity index of trees with given number of pendent vertices |
Cui, Qing |
2017 |
96-97 | Index 1 |
p. 213-221 9 p. |
artikel |
|
| 2345 | On the geodetic iteration number of a graph in which geodesic and monophonic convexities are equivalent |
Moscarini, Marina |
|
96-97 | Index 1 |
p. 142-152 |
artikel |
|
| 2346 | On the global rigidity of tensegrity graphs |
Garamvölgyi, Dániel |
|
96-97 | Index 1 |
p. 114-122 |
artikel |
|
| 2347 | On the growth of components with non-fixed excesses |
Baert, Anne-Elisabeth |
2003 |
96-97 | Index 1 |
p. 487-493 7 p. |
artikel |
|
| 2348 | On the Gutman index and minimum degree |
Mazorodze, Jaya Percival |
2014 |
96-97 | Index 1 |
p. 77-82 6 p. |
artikel |
|
| 2349 | On the ( h , k ) -domination numbers of iterated line digraphs |
Hasunuma, Toru |
2012 |
96-97 | Index 1 |
p. 1859-1863 5 p. |
artikel |
|
| 2350 | On the hole index of L(2,1)-labelings of r-regular graphs |
Adams, Sarah Spence |
2007 |
96-97 | Index 1 |
p. 2391-2393 3 p. |
artikel |
|
| 2351 | On the hyperbolicity of bipartite graphs and intersection graphs |
Coudert, David |
2016 |
96-97 | Index 1 |
p. 187-195 9 p. |
artikel |
|
| 2352 | On the immunity of rotation symmetric Boolean functions against fast algebraic attacks |
Zhang, Yin |
2014 |
96-97 | Index 1 |
p. 17-27 11 p. |
artikel |
|
| 2353 | On the independence polynomial of the corona of graphs |
Levit, Vadim E. |
2016 |
96-97 | Index 1 |
p. 85-93 9 p. |
artikel |
|
| 2354 | On the index of maximum density for irreducible Boolean matrices |
Yu, Shao Jia |
1988 |
96-97 | Index 1 |
p. 147-156 10 p. |
artikel |
|
| 2355 | On the α -index of minimally 2-connected graphs with given order or size |
Lou, Jiayu |
|
96-97 | Index 1 |
p. 281-291 |
artikel |
|
| 2356 | On the in–out–proper orientations of graphs |
Dehghan, Ali |
|
96-97 | Index 1 |
p. 129-138 |
artikel |
|
| 2357 | On the intersection of all critical sets of a unicyclic graph |
Levit, Vadim E. |
2014 |
96-97 | Index 1 |
p. 409-414 6 p. |
artikel |
|
| 2358 | On the Δ -interval and the Δ -convexity numbers of graphs and graph products |
Anand, Bijo S. |
|
96-97 | Index 1 |
p. 487-498 |
artikel |
|
| 2359 | On the k -edge-incident subgraph problem and its variants |
Liang, Hongyu |
2013 |
96-97 | Index 1 |
p. 2985-2991 7 p. |
artikel |
|
| 2360 | On the kernelization of ranking r -CSPs: Linear vertex-kernels for generalizations of Feedback Arc Set and Betweenness in tournaments |
Perez, Anthony |
2015 |
96-97 | Index 1 |
p. 214-225 12 p. |
artikel |
|
| 2361 | On the Kirchhoff index of a unicyclic graph and the matchings of the subdivision |
Chen, Yulan |
|
96-97 | Index 1 |
p. 19-24 |
artikel |
|
| 2362 | On the k th smallest and k th greatest modified Wiener indices of trees |
Liu, Muhuo |
2010 |
96-97 | Index 1 |
p. 699-705 7 p. |
artikel |
|
| 2363 | On the largest matching roots of graphs with a given number of pendent vertices |
Zhang, Hailiang |
2019 |
96-97 | Index 1 |
p. 339-344 |
artikel |
|
| 2364 | On the L 2 -discrepancy |
Oh, Jinsoo |
2007 |
96-97 | Index 1 |
p. 2039-2042 4 p. |
artikel |
|
| 2365 | On the least size of a graph with a given degree set |
Tripathi, Amitabha |
2006 |
96-97 | Index 1 |
p. 2530-2536 7 p. |
artikel |
|
| 2366 | On the lifetime of a random binary sequence |
Eryılmaz, Serkan |
2011 |
96-97 | Index 1 |
p. 1646-1649 4 p. |
artikel |
|
| 2367 | On the limit of the sequence { C m ( D ) } m = 1 ∞ for a multipartite tournament D |
Jung, Ji-Hwan |
|
96-97 | Index 1 |
p. 1-13 |
artikel |
|
| 2368 | On the linear description of the Huffman trees polytope |
Maurras, Jean-Francois |
2014 |
96-97 | Index 1 |
p. 225-236 12 p. |
artikel |
|
| 2369 | On the linear ( n − 1 ) -arboricity of K n ( m ) |
Xue, Bing |
2010 |
96-97 | Index 1 |
p. 1546-1550 5 p. |
artikel |
|
| 2370 | On the list dynamic coloring of graphs |
Akbari, S. |
2009 |
96-97 | Index 1 |
p. 3005-3007 3 p. |
artikel |
|
| 2371 | On the L ( 2 , 1 ) -labelings of amalgamations of graphs |
Adams, Sarah Spence |
2013 |
96-97 | Index 1 |
p. 881-888 8 p. |
artikel |
|
| 2372 | On the locating chromatic number of Kneser graphs |
Behtoei, Ali |
2011 |
96-97 | Index 1 |
p. 2214-2221 8 p. |
artikel |
|
| 2373 | On the longest path of a randomly weighted tournament |
Yuster, Raphael |
2017 |
96-97 | Index 1 |
p. 121-132 12 p. |
artikel |
|
| 2374 | On the LU factorization of the Vandermonde matrix |
Yang, Sheng-liang |
2005 |
96-97 | Index 1 |
p. 102-105 4 p. |
artikel |
|
| 2375 | On “the matching polynomial of a polygraph” |
Broersma, H.J. |
1993 |
96-97 | Index 1 |
p. 79-86 8 p. |
artikel |
|
| 2376 | On the maximum diversity of hypergraphs with fixed matching number |
Frankl, Peter |
|
96-97 | Index 1 |
p. 120-135 |
artikel |
|
| 2377 | On the maximum sigma index of k -cyclic graphs |
Ali, Akbar |
|
96-97 | Index 1 |
p. 58-62 |
artikel |
|
| 2378 | On the maximum weight of a planar graph of given order and size |
Gajdoš, Andrej |
2014 |
96-97 | Index 1 |
p. 101-110 10 p. |
artikel |
|
| 2379 | On the max min vertex cover problem |
Boria, Nicolas |
2015 |
96-97 | Index 1 |
p. 62-71 10 p. |
artikel |
|
| 2380 | On the membership problem for regular DNLC grammars |
Aalbersberg, IJ.J. |
1986 |
96-97 | Index 1 |
p. 79-85 7 p. |
artikel |
|
| 2381 | On the minimal energy of conjugated unicyclic graphs with maximum degree at most 3 |
Ma, Hongping |
2015 |
96-97 | Index 1 |
p. 186-198 13 p. |
artikel |
|
| 2382 | On the minimal energy of unicyclic Hückel molecular graphs possessing Kekulé structures |
Cao, Yinmei |
2009 |
96-97 | Index 1 |
p. 913-919 7 p. |
artikel |
|
| 2383 | On the minimum Harary index of graphs with a given diameter or independence number |
Borovićanin, Bojana |
|
96-97 | Index 1 |
p. 331-345 |
artikel |
|
| 2384 | On the minimum size of graphs with given generalized connectivity |
Zhao, Shu-Li |
|
96-97 | Index 1 |
p. 88-95 |
artikel |
|
| 2385 | On the minimum spectral radius of graphs with given order and dissociation number |
Zhao, Jing |
|
96-97 | Index 1 |
p. 487-501 |
artikel |
|
| 2386 | On the minimum vertex cover of generalized Petersen graphs |
Jin, Dannielle D.D. |
2019 |
96-97 | Index 1 |
p. 309-318 |
artikel |
|
| 2387 | On the monotone likelihood ratio property for the convolution of independent binomial random variables |
Rukhin, Andrey |
2009 |
96-97 | Index 1 |
p. 2562-2564 3 p. |
artikel |
|
| 2388 | On the Nash number and the diminishing Grundy number of a graph |
Havet, Frédéric |
|
96-97 | Index 1 |
p. 1-16 |
artikel |
|
| 2389 | On the NBC-complexes and β -invariants of abstract convex geometries |
Nakamura, Masataka |
2009 |
96-97 | Index 1 |
p. 1799-1805 7 p. |
artikel |
|
| 2390 | On the non-unit count of interval graphs |
Apke, A. |
2015 |
96-97 | Index 1 |
p. 2-7 6 p. |
artikel |
|
| 2391 | On the N th 2-adic complexity of binary sequences identified with algebraic 2-adic integers |
Chen, Zhixiong |
|
96-97 | Index 1 |
p. 279-289 |
artikel |
|
| 2392 | On the number of alternating paths in random graphs |
Bennett, Patrick |
|
96-97 | Index 1 |
p. 84-97 |
artikel |
|
| 2393 | On the number of blocks required to access the core |
Béal, Sylvain |
2012 |
96-97 | Index 1 |
p. 925-932 8 p. |
artikel |
|
| 2394 | On the number of edges in some graphs |
Lai, Chunhui |
|
96-97 | Index 1 |
p. 751-755 |
artikel |
|
| 2395 | On the number of generators for transeunt triangles |
Butler, J.T. |
2001 |
96-97 | Index 1 |
p. 309-316 8 p. |
artikel |
|
| 2396 | On the number of maximal independent sets in minimum colorings of split graphs |
Brešar, Boštjan |
|
96-97 | Index 1 |
p. 352-356 |
artikel |
|
| 2397 | On the number of optimal identifying codes in a twin-free graph |
Honkala, Iiro |
2015 |
96-97 | Index 1 |
p. 111-119 9 p. |
artikel |
|
| 2398 | On the number of perfect matchings of line graphs |
Dong, Fengming |
2013 |
96-97 | Index 1 |
p. 794-801 8 p. |
artikel |
|
| 2399 | On the number of perfect matchings of middle graphs |
Lai, Jingchao |
|
96-97 | Index 1 |
p. 86-91 |
artikel |
|
| 2400 | On the number of points with pairwise integral distances on a circle |
Bat-Ochir, Ganbileg |
2019 |
96-97 | Index 1 |
p. 17-32 |
artikel |
|
| 2401 | On the number of transversals in a class of Latin squares |
Donovan, Diane M. |
2018 |
96-97 | Index 1 |
p. 202-205 |
artikel |
|
| 2402 | On the number of transversals in latin squares |
Potapov, Vladimir N. |
2016 |
96-97 | Index 1 |
p. 194-196 3 p. |
artikel |
|
| 2403 | On the number of update digraphs and its relation with the feedback arc sets and tournaments |
Aracena, J. |
2013 |
96-97 | Index 1 |
p. 1345-1355 11 p. |
artikel |
|
| 2404 | On the number of words containing the factor ( aba ) k |
Tomescu, Ioan |
2007 |
96-97 | Index 1 |
p. 1506-1511 6 p. |
artikel |
|
| 2405 | On the occurrence of null clauses in random instances of satisfiability |
Franco, John |
1993 |
96-97 | Index 1 |
p. 203-209 7 p. |
artikel |
|
| 2406 | On the optimal strongly connected orientations of city street graphs IV: Four east-west avenues or north-south streets |
Roberts, Fred S. |
1994 |
96-97 | Index 1 |
p. 331-356 26 p. |
artikel |
|
| 2407 | On the ordering of graphs with respect to their matching numbers |
Gutman, Ivan |
1986 |
96-97 | Index 1 |
p. 25-33 9 p. |
artikel |
|
| 2408 | On the order of the largest induced tree in a random graph |
Palka, Zbigniew |
1986 |
96-97 | Index 1 |
p. 75-83 9 p. |
artikel |
|
| 2409 | On the packing chromatic number of Moore graphs |
Fresán-Figueroa, J. |
|
96-97 | Index 1 |
p. 185-193 |
artikel |
|
| 2410 | On the packing chromatic number of some lattices |
Finbow, Arthur S. |
2010 |
96-97 | Index 1 |
p. 1224-1228 5 p. |
artikel |
|
| 2411 | On the partition dimension of trees |
Rodríguez-Velázquez, Juan A. |
2014 |
96-97 | Index 1 |
p. 204-209 6 p. |
artikel |
|
| 2412 | On the path separation number of graphs |
Balogh, József |
2016 |
96-97 | Index 1 |
p. 26-33 8 p. |
artikel |
|
| 2413 | On the p-connectedness of graphs – a survey |
Babel, Luitpold |
1999 |
96-97 | Index 1 |
p. 11-33 23 p. |
artikel |
|
| 2414 | On the P 3 -hull number of Hamming graphs |
Brešar, Boštjan |
|
96-97 | Index 1 |
p. 48-52 |
artikel |
|
| 2415 | On the polyhedral structure of uniform cut polytopes |
Neto, José |
2014 |
96-97 | Index 1 |
p. 62-70 9 p. |
artikel |
|
| 2416 | On the polynomiality of finding K DMDGP re-orders |
Lavor, Carlile |
2019 |
96-97 | Index 1 |
p. 190-194 |
artikel |
|
| 2417 | On the potential function σ ( H , m , n ) of an arbitrary bipartite graph H |
Yin, Jian-Hua |
|
96-97 | Index 1 |
p. 189-194 |
artikel |
|
| 2418 | On the power of synchronization in parallel computations |
Hromkovič, Juraj |
1991 |
96-97 | Index 1 |
p. 155-182 28 p. |
artikel |
|
| 2419 | On the precise value of the strong chromatic index of a planar graph with a large girth |
Chang, Gerard Jennhwa |
|
96-97 | Index 1 |
p. 389-397 |
artikel |
|
| 2420 | On the probabilistic minimum coloring and minimum k -coloring |
Murat, Cécile |
2006 |
96-97 | Index 1 |
p. 564-586 23 p. |
artikel |
|
| 2421 | On the rainbow planar Turán number of double stars |
He, Shunhai |
|
96-97 | Index 1 |
p. 167-175 |
artikel |
|
| 2422 | On the random version of the Erdős matching conjecture |
Alishahi, Meysam |
2019 |
96-97 | Index 1 |
p. 1-9 |
artikel |
|
| 2423 | On the range maximum-sum segment query problem |
Chen, Kuan-Yu |
2007 |
96-97 | Index 1 |
p. 2043-2052 10 p. |
artikel |
|
| 2424 | On the range of size of sum graphs & integral sum graphs of a given order |
Tiwari, Apurv |
2013 |
96-97 | Index 1 |
p. 2653-2661 9 p. |
artikel |
|
| 2425 | On the ratio between the maximum weight of a perfect matching and the maximum weight of a matching |
Mazzuoccolo, Giuseppe |
|
96-97 | Index 1 |
p. 19-25 |
artikel |
|
| 2426 | On the ratio of prefix codes to all uniquely decodable codes with a given length distribution |
Woryna, Adam |
2018 |
96-97 | Index 1 |
p. 205-213 |
artikel |
|
| 2427 | On the reciprocal degree distance of graphs |
Hua, Hongbo |
2012 |
96-97 | Index 1 |
p. 1152-1163 12 p. |
artikel |
|
| 2428 | On the recognition of permuted bottleneck Monge matrices |
Klinz, Bettina |
1995 |
96-97 | Index 1 |
p. 43-74 32 p. |
artikel |
|
| 2429 | On the reduction method for integer linear programs, II |
Elimam, A.A. |
1985 |
96-97 | Index 1 |
p. 241-260 20 p. |
artikel |
|
| 2430 | On the reformulated reciprocal sum-degree distance of graph transformations |
Li, Shuchao |
2015 |
96-97 | Index 1 |
p. 162-173 12 p. |
artikel |
|
| 2431 | On the relations between arboricity and independent number or covering number |
Zhongfu, Zhang |
1998 |
96-97 | Index 1 |
p. 279-283 5 p. |
artikel |
|
| 2432 | On the relative distances of nine or ten points in the boundary of a plane convex body |
Su, Zhanjun |
2012 |
96-97 | Index 1 |
p. 303-305 3 p. |
artikel |
|
| 2433 | On the removal of forbidden graphs by edge-deletion or by edge-contraction |
Watanabe, Toshimasa |
1981 |
96-97 | Index 1 |
p. 151-153 3 p. |
artikel |
|
| 2434 | On the Roman domination in the lexicographic product of graphs |
Šumenjak, Tadeja Kraner |
2012 |
96-97 | Index 1 |
p. 2030-2036 7 p. |
artikel |
|
| 2435 | On the roots of domination polynomial of graphs |
Oboudi, Mohammad Reza |
2016 |
96-97 | Index 1 |
p. 126-131 6 p. |
artikel |
|
| 2436 | On the roots of independence polynomials of almost all very well-covered graphs |
Levit, Vadim E. |
2008 |
96-97 | Index 1 |
p. 478-491 14 p. |
artikel |
|
| 2437 | On the second-order nonlinearity of the hidden weighted bit function |
Wang, Qichun |
2016 |
96-97 | Index 1 |
p. 197-202 6 p. |
artikel |
|
| 2438 | On the semi-proper orientations of graphs |
Dehghan, Ali |
|
96-97 | Index 1 |
p. 9-25 |
artikel |
|
| 2439 | On the signed Roman k -domination: Complexity and thin torus graphs |
Shao, Zehui |
2017 |
96-97 | Index 1 |
p. 175-186 12 p. |
artikel |
|
| 2440 | On the signed total Roman domination and domatic numbers of graphs |
Volkmann, Lutz |
2016 |
96-97 | Index 1 |
p. 179-186 8 p. |
artikel |
|
| 2441 | On the signless Laplacian Estrada index of bicyclic graphs |
Wang, Kun |
2018 |
96-97 | Index 1 |
p. 169-174 |
artikel |
|
| 2442 | On the signless Laplacian Estrada index of cacti |
Wang, Kun |
2019 |
96-97 | Index 1 |
p. 189-195 |
artikel |
|
| 2443 | On the size of graphs without repeated cycle lengths |
Lai, Chunhui |
2017 |
96-97 | Index 1 |
p. 226-229 |
artikel |
|
| 2444 | On the size of identifying codes in triangle-free graphs |
Foucaud, Florent |
2012 |
96-97 | Index 1 |
p. 1532-1546 15 p. |
artikel |
|
| 2445 | On the size of the largest empty box amidst a point set |
Aistleitner, Christoph |
2017 |
96-97 | Index 1 |
p. 146-150 5 p. |
artikel |
|
| 2446 | On the sizes of generalized cactus graphs |
Zhang, Licheng |
|
96-97 | Index 1 |
p. 184-191 |
artikel |
|
| 2447 | On the smallest positive eigenvalue of bipartite graphs with a unique perfect matching |
Barik, Sasmita |
|
96-97 | Index 1 |
p. 311-318 |
artikel |
|
| 2448 | On the spanning connectivity of tournaments |
Zhang, Bo |
2018 |
96-97 | Index 1 |
p. 218-222 |
artikel |
|
| 2449 | On the spanning fan-connectivity of graphs |
Lin, Cheng-Kuan |
2009 |
96-97 | Index 1 |
p. 1342-1348 7 p. |
artikel |
|
| 2450 | On the splicing operation |
Păun, Gheorghe |
1996 |
96-97 | Index 1 |
p. 57-79 23 p. |
artikel |
|
| 2451 | On the Sprague–Grundyfunction of Exact k -Nim |
Boros, Endre |
2018 |
96-97 | Index 1 |
p. 1-14 |
artikel |
|
| 2452 | On the stable b -matching problem in multigraphs |
Borbel’ová, Viera |
2008 |
96-97 | Index 1 |
p. 673-684 12 p. |
artikel |
|
| 2453 | On the star of the family of independent sets in a graph |
Zhang, Huihui |
|
96-97 | Index 1 |
p. 170-178 |
artikel |
|
| 2454 | On the Steiner median of a tree |
Beineke, Lowell W. |
1996 |
96-97 | Index 1 |
p. 249-258 10 p. |
artikel |
|
| 2455 | On the strong metric dimension of corona product graphs and join graphs |
Kuziak, Dorota |
2013 |
96-97 | Index 1 |
p. 1022-1027 6 p. |
artikel |
|
| 2456 | On the strong Roman domination number of graphs |
Álvarez-Ruiz, M.P. |
2017 |
96-97 | Index 1 |
p. 44-59 16 p. |
artikel |
|
| 2457 | On the structure and deficiency of k -trees with bounded degree |
Borowiecka-Olszewska, Marta |
2016 |
96-97 | Index 1 |
p. 24-37 14 p. |
artikel |
|
| 2458 | On the structure and the number of prime implicants of 2- CNF s |
Talebanfard, Navid |
2016 |
96-97 | Index 1 |
p. 1-4 4 p. |
artikel |
|
| 2459 | On the structure of essentially-highly-connected polyhedral graphs |
Čekanová, K. |
|
96-97 | Index 1 |
p. 308-315 |
artikel |
|
| 2460 | On the structure of Laplacian characteristic polynomial for circulant foliation |
Kwon, Y.S. |
|
96-97 | Index 1 |
p. 338-349 |
artikel |
|
| 2461 | On the structure of trapezoid graphs |
Cheah, F. |
1996 |
96-97 | Index 1 |
p. 109-133 25 p. |
artikel |
|
| 2462 | On the subword complexity of iteratively generated infinite words |
Frid, A.E. |
2001 |
96-97 | Index 1 |
p. 115-120 6 p. |
artikel |
|
| 2463 | On the sum minimization version of the online bin covering problem |
Csirik, János |
2010 |
96-97 | Index 1 |
p. 1381-1393 13 p. |
artikel |
|
| 2464 | On the sum of k largest distance eigenvalues of graphs |
Lin, Huiqiu |
2019 |
96-97 | Index 1 |
p. 153-159 |
artikel |
|
| 2465 | On the third largest eigenvalue of eccentricity matrices of graphs |
Song, Yuanfen |
|
96-97 | Index 1 |
p. 237-259 |
artikel |
|
| 2466 | On the toll number of a graph |
Dravec, Tanja |
|
96-97 | Index 1 |
p. 250-257 |
artikel |
|
| 2467 | On the total forcing number of a graph |
Davila, Randy |
2019 |
96-97 | Index 1 |
p. 115-127 |
artikel |
|
| 2468 | On the total version of the covering Italian domination problem |
M., Alfred Raju |
|
96-97 | Index 1 |
p. 333-343 |
artikel |
|
| 2469 | On the total versions of 1-2-3-Conjecture for graphs and hypergraphs |
Davoodi, Akbar |
|
96-97 | Index 1 |
p. 1-10 |
artikel |
|
| 2470 | On the t -pebbling number and the 2 t -pebbling property of graphs |
Gao, Ze-Tu |
2013 |
96-97 | Index 1 |
p. 999-1005 7 p. |
artikel |
|
| 2471 | On the tractability of ( k , i ) -coloring |
Bhyravarapu, Sriram |
|
96-97 | Index 1 |
p. 329-339 |
artikel |
|
| 2472 | On the tree-depth of random graphs |
Perarnau, G. |
2014 |
96-97 | Index 1 |
p. 119-126 8 p. |
artikel |
|
| 2473 | On the treewidth of toroidal grids |
Kiyomi, Masashi |
2016 |
96-97 | Index 1 |
p. 303-306 4 p. |
artikel |
|
| 2474 | On the two-dimensional orthogonal drawing of series-parallel graphs |
Tayu, Satoshi |
2009 |
96-97 | Index 1 |
p. 1885-1895 11 p. |
artikel |
|
| 2475 | On the typical case complexity of graph optimization |
Faragó, András |
2005 |
96-97 | Index 1 |
p. 73-88 16 p. |
artikel |
|
| 2476 | On the uniqueness of some girth eight algebraically defined graphs |
Kronenthal, Brian G. |
2016 |
96-97 | Index 1 |
p. 188-194 7 p. |
artikel |
|
| 2477 | On the uniqueness of some girth eight algebraically defined graphs, Part II |
Kronenthal, Brian G. |
2019 |
96-97 | Index 1 |
p. 161-170 |
artikel |
|
| 2478 | On the unit interval number of a graph |
Andreae, Thomas |
1988 |
96-97 | Index 1 |
p. 1-7 7 p. |
artikel |
|
| 2479 | On the use of Boolean methods for the computation of the stability number |
Hertz, Alain |
1997 |
96-97 | Index 1 |
p. 183-203 21 p. |
artikel |
|
| 2480 | On the value of a random minimum spanning tree problem |
Frieze, A.M. |
1985 |
96-97 | Index 1 |
p. 47-56 10 p. |
artikel |
|
| 2481 | On the van der Waerden numbers w ( 2 ; 3 , t ) |
Ahmed, Tanbir |
2014 |
96-97 | Index 1 |
p. 27-51 25 p. |
artikel |
|
| 2482 | On the variable Wiener–Szeged inequality |
Vukićević, Žana Kovijanić |
|
96-97 | Index 1 |
p. 15-18 |
artikel |
|
| 2483 | On the vertex ranking problem for trapezoid, circular-arc and other graphs |
Deogun, Jitender S |
1999 |
96-97 | Index 1 |
p. 39-63 25 p. |
artikel |
|
| 2484 | On the weak chromatic number of random hypergraphs |
Semenov, Alexander |
|
96-97 | Index 1 |
p. 134-154 |
artikel |
|
| 2485 | On the weak Roman domination number of lexicographic product graphs |
Valveny, Magdalena |
2019 |
96-97 | Index 1 |
p. 257-270 |
artikel |
|
| 2486 | On the weight and nonlinearity of homogeneous rotation symmetric Boolean functions of degree 2 |
Kim, Hyeonjin |
2009 |
96-97 | Index 1 |
p. 428-432 5 p. |
artikel |
|
| 2487 | On the Wiener index of generalized Fibonacci cubes and Lucas cubes |
Klavžar, Sandi |
2015 |
96-97 | Index 1 |
p. 155-160 6 p. |
artikel |
|
| 2488 | On the windy postman problem |
Guan, Meigu |
1984 |
96-97 | Index 1 |
p. 41-46 6 p. |
artikel |
|
| 2489 | On the Zagreb index inequality of graphs with prescribed vertex degrees |
Andova, Vesna |
2011 |
96-97 | Index 1 |
p. 852-858 7 p. |
artikel |
|
| 2490 | On the Zagreb indices equality |
Abdo, Hosam |
2012 |
96-97 | Index 1 |
p. 1-8 8 p. |
artikel |
|
| 2491 | On three polynomial kernels of sequences for arbitrarily partitionable graphs |
Bensmail, Julien |
2016 |
96-97 | Index 1 |
p. 19-29 11 p. |
artikel |
|
| 2492 | On time-relaxed broadcasting networks |
Yao, Tianxing |
2010 |
96-97 | Index 1 |
p. 1029-1034 6 p. |
artikel |
|
| 2493 | On α -total domination in graphs |
Henning, Michael A. |
2012 |
96-97 | Index 1 |
p. 1143-1151 9 p. |
artikel |
|
| 2494 | On total domination vertex critical graphs of high connectivity |
Henning, Michael A. |
2009 |
96-97 | Index 1 |
p. 1969-1973 5 p. |
artikel |
|
| 2495 | On ( t , r ) broadcast domination numbers of grids |
Blessing, David |
2015 |
96-97 | Index 1 |
p. 19-40 22 p. |
artikel |
|
| 2496 | On trees and noncrossing partitions |
Klazar, Martin |
1998 |
96-97 | Index 1 |
p. 263-269 7 p. |
artikel |
|
| 2497 | On triangulating k -outerplanar graphs |
Biedl, Therese |
2015 |
96-97 | Index 1 |
p. 275-279 5 p. |
artikel |
|
| 2498 | On two conjectures concerning spanning tree edge dependences of graphs |
Yang, Yujun |
|
96-97 | Index 1 |
p. 32-42 |
artikel |
|
| 2499 | On two open problems on the normality of bent functions |
Polujan, Alexandr |
|
96-97 | Index 1 |
p. 115-118 |
artikel |
|
| 2500 | On unicyclic graphs whose second largest eigenvalue dose not exceed 1 |
Xu, Guang-Hui |
2004 |
96-97 | Index 1 |
p. 117-124 8 p. |
artikel |
|
| 2501 | On 3-uniform hypergraphs without a cycle of a given length |
Füredi, Zoltán |
2017 |
96-97 | Index 1 |
p. 582-588 7 p. |
artikel |
|
| 2502 | On unimodular graphs with a unique perfect matching |
Basumatary, Parameswar |
|
96-97 | Index 1 |
p. 49-61 |
artikel |
|
| 2503 | On upper bounds for multiple domination numbers of graphs |
Przybyło, Jakub |
2013 |
96-97 | Index 1 |
p. 2758-2763 6 p. |
artikel |
|
| 2504 | On variants of conflict-free-coloring for hypergraphs |
Cui, Zhen |
2017 |
96-97 | Index 1 |
p. 46-54 9 p. |
artikel |
|
| 2505 | On variations of the subset sum problem |
Alfonsín, J.L. Ramírez |
1998 |
96-97 | Index 1 |
p. 1-7 7 p. |
artikel |
|
| 2506 | On vertices of outdegree k in minimally k -arc-connected digraphs |
Fan, Jun |
|
96-97 | Index 1 |
p. 465-472 |
artikel |
|
| 2507 | On weight choosabilities of graphs with bounded maximum average degree |
Przybyło, Jakub |
2017 |
96-97 | Index 1 |
p. 663-672 10 p. |
artikel |
|
| 2508 | On Wiener index and average eccentricity of graphs of girth at least 6 and ( C 4 , C 5 ) -free graphs |
Alochukwu, Alex |
|
96-97 | Index 1 |
p. 98-111 |
artikel |
|
| 2509 | On Wiener numbers of polygonal nets |
Shiu, Wai Chee |
2002 |
96-97 | Index 1 |
p. 251-261 11 p. |
artikel |
|
| 2510 | On zero-sum free sequences contained in random subsets of finite cyclic groups |
Lee, Sang June |
|
96-97 | Index 1 |
p. 118-127 |
artikel |
|
| 2511 | Open-end bin packing: New and old analysis approaches |
Epstein, Leah |
|
96-97 | Index 1 |
p. 220-239 |
artikel |
|
| 2512 | Open neighborhood locating–dominating in trees |
Seo, Suk J. |
2011 |
96-97 | Index 1 |
p. 484-489 6 p. |
artikel |
|
| 2513 | Open shop problem with zero-one time operations and integer release date/deadline intervals |
Kubale, Marek |
1997 |
96-97 | Index 1 |
p. 213-223 11 p. |
artikel |
|
| 2514 | Open shop scheduling problems with late work criteria |
Błażewicz, Jacek |
2004 |
96-97 | Index 1 |
p. 1-24 24 p. |
artikel |
|
| 2515 | Opinion forming in Erdős–Rényi random graph and expanders |
Zehmakan, Ahad N. |
|
96-97 | Index 1 |
p. 280-290 |
artikel |
|
| 2516 | Optimal algorithms for constructing knight's tours on arbitrary n × m chessboards |
Lin, Shun-Shii |
2005 |
96-97 | Index 1 |
p. 219-232 14 p. |
artikel |
|
| 2517 | Optimal algorithms for dissemination of information in generalized communication modes |
Feldmann, R. |
1994 |
96-97 | Index 1 |
p. 55-78 24 p. |
artikel |
|
| 2518 | Optimal approximability of bookmark assignments |
Asahiro, Yuichi |
2013 |
96-97 | Index 1 |
p. 2361-2366 6 p. |
artikel |
|
| 2519 | Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization |
Boros, Endre |
1999 |
96-97 | Index 1 |
p. 69-88 20 p. |
artikel |
|
| 2520 | Optimal channel allocation for several types of cellular radio networks |
Niessen, Thomas |
1997 |
96-97 | Index 1 |
p. 155-170 16 p. |
artikel |
|
| 2521 | Optimal covering of the equidistant square grid network |
Letnik, Tomislav |
|
96-97 | Index 1 |
p. 85-89 |
artikel |
|
| 2522 | Optimal detection of a counterfeit coin with multi-arms balances |
De Bonis, Annalisa |
1995 |
96-97 | Index 1 |
p. 121-131 11 p. |
artikel |
|
| 2523 | Optimal identifying codes of two families of Cayley graphs |
Feng, Min |
|
96-97 | Index 1 |
p. 199-210 |
artikel |
|
| 2524 | Optimal interleaving schemes for correcting two-dimensional cluster errors |
Xu, Wen-Qing |
2007 |
96-97 | Index 1 |
p. 1200-1212 13 p. |
artikel |
|
| 2525 | Optimal key for taxons ordered in accordance with their frequencies |
Krichevskii, R.E. |
1981 |
96-97 | Index 1 |
p. 67-72 6 p. |
artikel |
|
| 2526 | Optimal layout of edge-weighted forests |
Fischer, Michael J |
1999 |
96-97 | Index 1 |
p. 135-159 25 p. |
artikel |
|
| 2527 | Optimal L ( d , 1 ) -labelings of certain direct products of cycles and Cartesian products of cycles |
Jha, Pranava K. |
2005 |
96-97 | Index 1 |
p. 257-265 9 p. |
artikel |
|
| 2528 | Optimal L ( 3 , 2 , 1 ) -labeling of triangular lattice |
Das, Sandip |
2017 |
96-97 | Index 1 |
p. 32-40 9 p. |
artikel |
|
| 2529 | Optimally balancing assembly lines with different workstations |
Nicosia, Gaia |
2002 |
96-97 | Index 1 |
p. 99-113 15 p. |
artikel |
|
| 2530 | Optimal matrix-segmentation by rectangles |
Engel, Konrad |
2009 |
96-97 | Index 1 |
p. 2015-2030 16 p. |
artikel |
|
| 2531 | Optimal on-line flow time with resource augmentation |
Epstein, Leah |
2006 |
96-97 | Index 1 |
p. 611-621 11 p. |
artikel |
|
| 2532 | Optimal orientations of products of paths and cycles |
Koh, K.M. |
1997 |
96-97 | Index 1 |
p. 163-174 12 p. |
artikel |
|
| 2533 | Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM |
Sajith, G. |
1996 |
96-97 | Index 1 |
p. 249-265 17 p. |
artikel |
|
| 2534 | Optimal pebbling number of graphs with given minimum degree |
Czygrinow, A. |
2019 |
96-97 | Index 1 |
p. 117-130 |
artikel |
|
| 2535 | Optimal popular matchings |
Kavitha, Telikepalli |
2009 |
96-97 | Index 1 |
p. 3181-3186 6 p. |
artikel |
|
| 2536 | Optimal radio labellings of complete m -ary trees |
Li, Xiangwen |
2010 |
96-97 | Index 1 |
p. 507-515 9 p. |
artikel |
|
| 2537 | Optimal ( r , ≤ 3 ) -locating–dominating codes in the infinite king grid |
Pelto, Mikko |
2013 |
96-97 | Index 1 |
p. 2597-2603 7 p. |
artikel |
|
| 2538 | Optimal separable partitioning in the plane |
Benelli, Michal |
1995 |
96-97 | Index 1 |
p. 215-224 10 p. |
artikel |
|
| 2539 | Optimal strategies for a fair betting game |
Klawe, Maria M. |
1979 |
96-97 | Index 1 |
p. 105-115 11 p. |
artikel |
|
| 2540 | Optimal transmission schedules in TWDM optical passive star networks |
Lee, Sang-Kyu |
1997 |
96-97 | Index 1 |
p. 81-91 11 p. |
artikel |
|
| 2541 | Optimal transport and integer partitions |
Hohloch, Sonja |
2015 |
96-97 | Index 1 |
p. 75-85 11 p. |
artikel |
|
| 2542 | Optimal ( t , r ) broadcasts on the infinite grid |
Drews, Benjamin F. |
2019 |
96-97 | Index 1 |
p. 183-197 |
artikel |
|
| 2543 | Optimization and reconstruction of hv -convex ( 0 , 1 ) -matrices |
Dahl, Geir |
2005 |
96-97 | Index 1 |
p. 93-105 13 p. |
artikel |
|
| 2544 | Optimization problems in dotted interval graphs |
Hermelin, Danny |
2014 |
96-97 | Index 1 |
p. 66-72 7 p. |
artikel |
|
| 2545 | Optimization tools for computing colorings of [ 1 , … , n ] with few monochromatic solutions on 3-variable linear equations |
De Loera, Jesús A. |
|
96-97 | Index 1 |
p. 159-178 |
artikel |
|
| 2546 | O ( 1 ) query time algorithm for all pairs shortest distances on permutation graphs |
Sprague, Alan P. |
2007 |
96-97 | Index 1 |
p. 365-373 9 p. |
artikel |
|
| 2547 | Ordered biclique partitions and communication complexity problems |
Shigeta, Manami |
2015 |
96-97 | Index 1 |
p. 248-252 5 p. |
artikel |
|
| 2548 | Ordered size Ramsey number of paths |
Balogh, József |
|
96-97 | Index 1 |
p. 13-18 |
artikel |
|
| 2549 | Ordering connected graphs having small degree distances |
Tomescu, Ioan |
2010 |
96-97 | Index 1 |
p. 1714-1717 4 p. |
artikel |
|
| 2550 | Orderings of uniquely colorable hypergraphs |
Bujtás, Csilla |
2007 |
96-97 | Index 1 |
p. 1395-1407 13 p. |
artikel |
|
| 2551 | Ordering trees by their distance spectral radii |
Lin, Wenshui |
2016 |
96-97 | Index 1 |
p. 106-110 5 p. |
artikel |
|
| 2552 | Order statistics and estimating cardinalities of massive data sets |
Giroire, Frédéric |
2009 |
96-97 | Index 1 |
p. 406-427 22 p. |
artikel |
|
| 2553 | Ore-type condition for Hamilton ℓ -cycle in k -uniform hypergraphs |
Jiang, Taijiang |
|
96-97 | Index 1 |
p. 270-275 |
artikel |
|
| 2554 | Orientable domination in product-like graphs |
Anderson, Sarah |
|
96-97 | Index 1 |
p. 62-69 |
artikel |
|
| 2555 | Orientations of graphs with maximum Wiener index |
Knor, Martin |
2016 |
96-97 | Index 1 |
p. 121-129 9 p. |
artikel |
|
| 2556 | Oriented diameter of star graphs |
Kumar, K.S. Ajish |
|
96-97 | Index 1 |
p. 362-371 |
artikel |
|
| 2557 | Oriented matroid systems |
Huseby, Arne Bang |
2011 |
96-97 | Index 1 |
p. 31-45 15 p. |
artikel |
|
| 2558 | Orthogonal covers by multiplication graphs |
Gronau, Hans-Dietrich O.F. |
2009 |
96-97 | Index 1 |
p. 2048-2056 9 p. |
artikel |
|
| 2559 | Orthogonal weighted linear L 1 and L ∞ approximation and applications |
Houle, Michael E. |
1993 |
96-97 | Index 1 |
p. 217-232 16 p. |
artikel |
|
| 2560 | Outer-independent total Roman domination in graphs |
Cabrera Martínez, Abel |
2019 |
96-97 | Index 1 |
p. 107-119 |
artikel |
|
| 2561 | Overlaps help: Improved bounds for group testing with interval queries |
Cicalese, Ferdinando |
2007 |
96-97 | Index 1 |
p. 288-299 12 p. |
artikel |
|
| 2562 | Packing and covering tetrahedra |
Ghosh, S.K. |
2013 |
96-97 | Index 1 |
p. 1209-1215 7 p. |
artikel |
|
| 2563 | Packing 2- and 3-stars into ( 2 , 3 ) -regular graphs |
Xi, Wenying |
|
96-97 | Index 1 |
p. 440-452 |
artikel |
|
| 2564 | Packing a number of copies of a ( p , q ) -graph |
Wang, Yun |
|
96-97 | Index 1 |
p. 302-312 |
artikel |
|
| 2565 | Packing bipartite graphs with covers of complete bipartite graphs |
Chalopin, Jérémie |
2014 |
96-97 | Index 1 |
p. 40-50 11 p. |
artikel |
|
| 2566 | Packing chromatic number of distance graphs |
Ekstein, Jan |
2012 |
96-97 | Index 1 |
p. 518-524 7 p. |
artikel |
|
| 2567 | Packing coloring of hypercubes with extended Hamming codes |
Gregor, Petr |
|
96-97 | Index 1 |
p. 269-277 |
artikel |
|
| 2568 | Packing ( 1 , 1 , 2 , 2 ) -coloring of some subcubic graphs |
Liu, Runrun |
|
96-97 | Index 1 |
p. 626-630 |
artikel |
|
| 2569 | Packing ( 1 , 1 , 2 , 4 ) -coloring of subcubic outerplanar graphs |
Kostochka, Alexandr |
|
96-97 | Index 1 |
p. 8-15 |
artikel |
|
| 2570 | Packing directed cycles efficiently |
Nutov, Zeev |
2007 |
96-97 | Index 1 |
p. 82-91 10 p. |
artikel |
|
| 2571 | Packing K r s in bounded degree graphs |
McKay, Michael |
|
96-97 | Index 1 |
p. 20-32 |
artikel |
|
| 2572 | Packing of maximal independent mixed arborescences |
Gao, Hui |
|
96-97 | Index 1 |
p. 313-319 |
artikel |
|
| 2573 | Packing of permutations into Latin squares |
Foldes, Stephan |
|
96-97 | Index 1 |
p. 102-108 |
artikel |
|
| 2574 | Packing paths: Recycling saves time |
Binkele-Raible, Daniel |
2013 |
96-97 | Index 1 |
p. 1686-1698 13 p. |
artikel |
|
| 2575 | Packing problems in edge-colored graphs |
Hell, P. |
1994 |
96-97 | Index 1 |
p. 295-306 12 p. |
artikel |
|
| 2576 | Packing two copies of a tree into a bipartite graph with restrained maximum degree |
Li, Hui |
|
96-97 | Index 1 |
p. 23-34 |
artikel |
|
| 2577 | Packing 3-vertex paths in claw-free graphs and related topics |
Kelmans, Alexander |
2011 |
96-97 | Index 1 |
p. 112-127 16 p. |
artikel |
|
| 2578 | Pagoda functions for peg solitaire on graphs |
Kreh, Martin |
|
96-97 | Index 1 |
p. 184-202 |
artikel |
|
| 2579 | Paintability of complete bipartite graphs |
Kashima, Masaki |
|
96-97 | Index 1 |
p. 279-289 |
artikel |
|
| 2580 | Paired many-to-many disjoint path covers of hypertori |
Kronenthal, Brian G. |
2017 |
96-97 | Index 1 |
p. 14-20 7 p. |
artikel |
|
| 2581 | Palindromic factorization of rich words |
Rukavicka, Josef |
|
96-97 | Index 1 |
p. 95-102 |
artikel |
|
| 2582 | Panconnectivity and edge-pancyclicity of k -ary n -cubes with faulty elements |
Lin, Shangwei |
2011 |
96-97 | Index 1 |
p. 212-223 12 p. |
artikel |
|
| 2583 | Panconnectivity and edge-pancyclicity of multidimensional torus networks |
Chen, Xie-Bin |
2014 |
96-97 | Index 1 |
p. 33-45 13 p. |
artikel |
|
| 2584 | Pancyclic orderings of in-tournaments |
Tewes, Meike |
2002 |
96-97 | Index 1 |
p. 239-249 11 p. |
artikel |
|
| 2585 | Parallel algorithms for separable permutations |
Yugandhar, V. |
2005 |
96-97 | Index 1 |
p. 343-364 22 p. |
artikel |
|
| 2586 | Parallel machine scheduling to minimize costs for earliness and number of tardy jobs |
Kahlbacher, H.G. |
1993 |
96-97 | Index 1 |
p. 139-164 26 p. |
artikel |
|
| 2587 | Parallel machine scheduling with a common server |
Hall, Nicholas G. |
2000 |
96-97 | Index 1 |
p. 223-243 21 p. |
artikel |
|
| 2588 | Parallel machine scheduling with splitting jobs |
Xing, Wenxun |
2000 |
96-97 | Index 1 |
p. 259-269 11 p. |
artikel |
|
| 2589 | Parallel machines scheduling with nonsimultaneous machine available time |
Lee, Chung-Yee |
1991 |
96-97 | Index 1 |
p. 53-61 9 p. |
artikel |
|
| 2590 | Parallel sorting |
Bollobás, Béla |
1983 |
96-97 | Index 1 |
p. 1-11 11 p. |
artikel |
|
| 2591 | Parameterized and exact algorithms for class domination coloring |
Krithika, R. |
|
96-97 | Index 1 |
p. 286-299 |
artikel |
|
| 2592 | Parameterized complexity for iterated type partitions and modular-width |
Cordasco, Gennaro |
|
96-97 | Index 1 |
p. 100-122 |
artikel |
|
| 2593 | Parameterized complexity of locally minimal defensive alliances |
Gaikwad, Ajinkya |
|
96-97 | Index 1 |
p. 324-340 |
artikel |
|
| 2594 | Parameterized complexity of vertex colouring |
Cai, Leizhen |
2003 |
96-97 | Index 1 |
p. 415-429 15 p. |
artikel |
|
| 2595 | Parameterized extension complexity of independent set and related problems |
Gajarský, Jakub |
2018 |
96-97 | Index 1 |
p. 56-67 |
artikel |
|
| 2596 | ℓ -Parametric eigenproblem in max-algebra |
Plavka, Ján |
2005 |
96-97 | Index 1 |
p. 16-28 13 p. |
artikel |
|
| 2597 | Parametric min-cuts analysis in a network |
Aneja, Y.P |
2003 |
96-97 | Index 1 |
p. 679-689 11 p. |
artikel |
|
| 2598 | Parametric shortest path algorithms with an application to cyclic staffing |
Karp, Richard M. |
1981 |
96-97 | Index 1 |
p. 37-45 9 p. |
artikel |
|
| 2599 | Pareto optima for total weighted completion time and maximum lateness on a single machine |
Steiner, George |
2007 |
96-97 | Index 1 |
p. 2341-2354 14 p. |
artikel |
|
| 2600 | Parity polytopes and binarization |
Ermel, Dominik |
|
96-97 | Index 1 |
p. 24-30 |
artikel |
|
| 2601 | Partial and perfect path covers of cographs |
Kirkpatrick, D.G. |
1998 |
96-97 | Index 1 |
p. 143-153 11 p. |
artikel |
|
| 2602 | Partial domination of maximal outerplanar graphs |
Borg, Peter |
|
96-97 | Index 1 |
p. 306-314 |
artikel |
|
| 2603 | Partial monotonizations of Hamiltonian cycle polytopes: dimensions and diameters |
Sierksma, Gerard |
2000 |
96-97 | Index 1 |
p. 173-182 10 p. |
artikel |
|
| 2604 | Partial Petrial polynomials for complete graphs and paths |
Yan, Qi |
|
96-97 | Index 1 |
p. 281-289 |
artikel |
|
| 2605 | Partition dimension of rooted product graphs |
Monica, Mohan Chris |
2019 |
96-97 | Index 1 |
p. 138-147 |
artikel |
|
| 2606 | Partitioning a graph into offensive k -alliances |
Sigarreta, José M. |
2011 |
96-97 | Index 1 |
p. 224-231 8 p. |
artikel |
|
| 2607 | Partitioning a matrix with non-guillotine cuts to minimize the maximum cost |
Mingozzi, Aristide |
2002 |
96-97 | Index 1 |
p. 243-260 18 p. |
artikel |
|
| 2608 | Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking |
Grubman, Tony |
2016 |
96-97 | Index 1 |
p. 101-113 13 p. |
artikel |
|
| 2609 | Partitioning graphs into induced subgraphs |
Knop, Dušan |
|
96-97 | Index 1 |
p. 31-42 |
artikel |
|
| 2610 | Partitioning of a graph into induced subgraphs not containing prescribed cliques |
Rowshan, Yaser |
|
96-97 | Index 1 |
p. 68-80 |
artikel |
|
| 2611 | Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition |
Tangjai, Wipawee |
|
96-97 | Index 1 |
p. 347-354 |
artikel |
|
| 2612 | Partitioning problems in dense hypergraphs |
Czygrinow, A. |
2002 |
96-97 | Index 1 |
p. 179-191 13 p. |
artikel |
|
| 2613 | Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles |
Chiba, Shuya |
|
96-97 | Index 1 |
p. 1-13 |
artikel |
|
| 2614 | Partitioning vertices into in- and out-dominating sets in digraphs |
Nakamura, Kosuke |
|
96-97 | Index 1 |
p. 43-54 |
artikel |
|
| 2615 | Partitioning vertices of graphs into paths of the same length |
Duginov, Oleg |
|
96-97 | Index 1 |
p. 179-195 |
artikel |
|
| 2616 | Partition into almost straight trails |
Birkholz, Harald |
2014 |
96-97 | Index 1 |
p. 127-135 9 p. |
artikel |
|
| 2617 | Partition into cliques for cubic graphs: Planar case, complexity and approximation |
Cerioli, M.R. |
2008 |
96-97 | Index 1 |
p. 2270-2278 9 p. |
artikel |
|
| 2618 | Partition line graphs of multigraphs into two subgraphs with large chromatic numbers |
Lv, Jian-Bo |
|
96-97 | Index 1 |
p. 44-48 |
artikel |
|
| 2619 | Partitions of graphs and multigraphs under degree constraints |
Song, Jialei |
|
96-97 | Index 1 |
p. 134-145 |
artikel |
|
| 2620 | Partitions of graphs into small and large sets |
Bojilov, Asen |
2013 |
96-97 | Index 1 |
p. 1912-1924 13 p. |
artikel |
|
| 2621 | Partitions of multigraphs under minimum degree constraints |
Schweser, Thomas |
2019 |
96-97 | Index 1 |
p. 269-275 |
artikel |
|
| 2622 | Partitions of Z m with identical representation functions |
Sun, Cui-Fang |
|
96-97 | Index 1 |
p. 1-10 |
artikel |
|
| 2623 | 3-path-connectivity of Cayley graphs generated by transposition trees |
Jin, Qihui |
|
96-97 | Index 1 |
p. 292-299 |
artikel |
|
| 2624 | Path covering number and L ( 2 , 1 ) -labeling number of graphs |
Lu, Changhong |
2013 |
96-97 | Index 1 |
p. 2062-2074 13 p. |
artikel |
|
| 2625 | Path eccentricity of graphs |
Gómez, Renzo |
|
96-97 | Index 1 |
p. 1-13 |
artikel |
|
| 2626 | Path 3-(edge-)connectivity of lexicographic product graphs |
Ma, Tianlong |
|
96-97 | Index 1 |
p. 152-161 |
artikel |
|
| 2627 | Path-fan Ramsey numbers |
Salman, A.N.M. |
2006 |
96-97 | Index 1 |
p. 1429-1436 8 p. |
artikel |
|
| 2628 | Path–kipas Ramsey numbers |
Salman, A.N.M. |
2007 |
96-97 | Index 1 |
p. 1878-1884 7 p. |
artikel |
|
| 2629 | Patience of matrix games |
Hansen, Kristoffer Arnsfelt |
2013 |
96-97 | Index 1 |
p. 2440-2459 20 p. |
artikel |
|
| 2630 | Pattern-avoiding alternating words |
Gao, Alice L.L. |
2016 |
96-97 | Index 1 |
p. 56-66 11 p. |
artikel |
|
| 2631 | Pattern-avoiding ( 0 , 1 ) -matrices and bases of permutation matrices |
Brualdi, Richard A. |
|
96-97 | Index 1 |
p. 196-211 |
artikel |
|
| 2632 | Pattern restricted Stirling k -ary words, the plateau statistic and the kernel method |
Ma, Shi-Mei |
2016 |
96-97 | Index 1 |
p. 100-108 9 p. |
artikel |
|
| 2633 | p-competition numbers |
Kim, Suh-ryung |
1993 |
96-97 | Index 1 |
p. 87-92 6 p. |
artikel |
|
| 2634 | P 3 -convexity on graphs with diameter two: Computing hull and interval numbers |
Cappelle, Márcia R. |
|
96-97 | Index 1 |
p. 368-378 |
artikel |
|
| 2635 | P 3 -equicoverable graphs—Research on H -equicoverable graphs |
Zhang, Yuqin |
2008 |
96-97 | Index 1 |
p. 647-661 15 p. |
artikel |
|
| 2636 | Perfect broadcasting in unlabeled networks |
Diks, Krzysztof |
1998 |
96-97 | Index 1 |
p. 33-47 15 p. |
artikel |
|
| 2637 | Perfect codes in m -Cayley hypergraphs |
Wannatong, Kantapong |
|
96-97 | Index 1 |
p. 105-111 |
artikel |
|
| 2638 | Perfect domination sets in Cayley graphs |
Kwon, Young Soo |
2014 |
96-97 | Index 1 |
p. 259-263 5 p. |
artikel |
|
| 2639 | Perfect double Roman domination of trees |
Egunjobi, Ayotunde T. |
|
96-97 | Index 1 |
p. 71-85 |
artikel |
|
| 2640 | Perfect Italian domination in graphs: Complexity and algorithms |
Pradhan, D. |
|
96-97 | Index 1 |
p. 271-295 |
artikel |
|
| 2641 | Perfect Italian domination in trees |
Haynes, Teresa W. |
2019 |
96-97 | Index 1 |
p. 164-177 |
artikel |
|
| 2642 | Perfect Italian domination on planar and regular graphs |
Lauri, Juho |
|
96-97 | Index 1 |
p. 676-687 |
artikel |
|
| 2643 | 1 -perfectly orientable K 4 -minor-free and outerplanar graphs |
Brešar, Boštjan |
2018 |
96-97 | Index 1 |
p. 33-45 |
artikel |
|
| 2644 | Perfect matching and distance spectral radius in graphs and bipartite graphs |
Zhang, Yuke |
|
96-97 | Index 1 |
p. 315-322 |
artikel |
|
| 2645 | Perfect matching covering, the Berge–Fulkerson conjecture, and the Fan–Raspaud conjecture |
Zhu, Qiang |
2014 |
96-97 | Index 1 |
p. 282-286 5 p. |
artikel |
|
| 2646 | Perfect matchings of ( 4 , 6 ) -fullerenes with largest forcing number |
Zhang, Yaxian |
|
96-97 | Index 1 |
p. 10-25 |
artikel |
|
| 2647 | Perfect out-forest problem and directed Steiner cycle packing problem |
Sun, Yuefang |
|
96-97 | Index 1 |
p. 201-209 |
artikel |
|
| 2648 | Perfect Roman domination in trees |
Henning, Michael A. |
2018 |
96-97 | Index 1 |
p. 235-245 |
artikel |
|
| 2649 | Perfect state transfer in NEPS of complete graphs |
Li, Yipeng |
|
96-97 | Index 1 |
p. 98-114 |
artikel |
|
| 2650 | Performance evaluation of demodulation with diversity—a combinatorial approach II: bijective methods |
Krob, D. |
2005 |
96-97 | Index 1 |
p. 403-421 19 p. |
artikel |
|
| 2651 | Performance of Coffman-Graham schedules in the presence of unit communication delays |
Hanen, C. |
1998 |
96-97 | Index 1 |
p. 93-108 16 p. |
artikel |
|
| 2652 | Periodic gossiping in back-to-back trees |
Labahn, Roger |
1997 |
96-97 | Index 1 |
p. 157-168 12 p. |
artikel |
|
| 2653 | Periodic gossiping on trees |
Labahn, Roger |
1994 |
96-97 | Index 1 |
p. 235-245 11 p. |
artikel |
|
| 2654 | Periodic template tests: A family of statistical randomness tests for a collection of binary sequences |
Sulak, Fatih |
2019 |
96-97 | Index 1 |
p. 191-204 |
artikel |
|
| 2655 | Permutation polynomials and their differential properties over residue class rings |
Yu, Yuyin |
2013 |
96-97 | Index 1 |
p. 3104-3108 5 p. |
artikel |
|
| 2656 | Permutation reconstruction from MinMax -Betweenness constraints |
Rusu, Irena |
2016 |
96-97 | Index 1 |
p. 106-119 14 p. |
artikel |
|
| 2657 | Persistency in combinatorial optimization problems on matroids |
Cechlárová, Katarı́na |
2001 |
96-97 | Index 1 |
p. 121-132 12 p. |
artikel |
|
| 2658 | Perspectives of Monge properties in optimization |
Burkard, Rainer E. |
1996 |
96-97 | Index 1 |
p. 95-161 67 p. |
artikel |
|
| 2659 | Pfaffian orientations, 0–1 permanents, and even cycles in directed graphs |
Vazirani, Vijay V. |
1989 |
96-97 | Index 1 |
p. 179-190 12 p. |
artikel |
|
| 2660 | Phase transitions of PP-complete satisfiability problems |
Bailey, Delbert D. |
2007 |
96-97 | Index 1 |
p. 1627-1639 13 p. |
artikel |
|
| 2661 | Pick-and-choose heuristics for partial set covering |
Fishburn, P.C. |
1988 |
96-97 | Index 1 |
p. 119-132 14 p. |
artikel |
|
| 2662 | Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable |
Du, Dingzhu |
2009 |
96-97 | Index 1 |
p. 2778-2784 7 p. |
artikel |
|
| 2663 | Planar graphs without 4- and 6-cycles are ( 3 , 4 ) -colorable |
Nakprasit, Kittikorn |
|
96-97 | Index 1 |
p. 44-51 |
artikel |
|
| 2664 | Planar graphs without 4-cycles and intersecting triangles are ( 1 , 1 , 0 ) -colorable |
Li, Xiangwen |
|
96-97 | Index 1 |
p. 236-247 |
artikel |
|
| 2665 | 1-planarity of complete multipartite graphs |
Czap, Július |
2012 |
96-97 | Index 1 |
p. 505-512 8 p. |
artikel |
|
| 2666 | Planar k-cycle resonant graphs with k=1,2 |
Guo, Xiaofeng |
2003 |
96-97 | Index 1 |
p. 383-397 15 p. |
artikel |
|
| 2667 | Planar projections of graphs |
Aravind, N.R. |
|
96-97 | Index 1 |
p. 216-222 |
artikel |
|
| 2668 | Points by degree and orbit size in chemical trees, II |
Bailey, C.K. |
1983 |
96-97 | Index 1 |
p. 157-164 8 p. |
artikel |
|
| 2669 | 2-Point site Voronoi diagrams |
Barequet, Gill |
2002 |
96-97 | Index 1 |
p. 37-54 18 p. |
artikel |
|
| 2670 | Polar cographs |
Ekim, T. |
2008 |
96-97 | Index 1 |
p. 1652-1660 9 p. |
artikel |
|
| 2671 | Polyhedral results for the precedence-constrained knapsack problem |
Boyd, E.Andrew |
1993 |
96-97 | Index 1 |
p. 185-201 17 p. |
artikel |
|
| 2672 | Polynomial algorithm for finding the largest independent sets in graphs without forks |
Alekseev, V.E. |
2004 |
96-97 | Index 1 |
p. 3-16 14 p. |
artikel |
|
| 2673 | Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion |
Bauer, D. |
2002 |
96-97 | Index 1 |
p. 13-23 11 p. |
artikel |
|
| 2674 | Polynomial delay hybrid algorithms to enumerate candidate keys for a relation |
Ennaoui, Karima |
|
96-97 | Index 1 |
p. 443-450 |
artikel |
|
| 2675 | Polynomial invariants for trees a statistical mechanics approach |
Conti, Roberto |
1998 |
96-97 | Index 1 |
p. 225-237 13 p. |
artikel |
|
| 2676 | Polynomially solvable cases for the maximum stable set problem |
Hertz, Alain |
1995 |
96-97 | Index 1 |
p. 195-210 16 p. |
artikel |
|
| 2677 | Polynomial testing of the query “IS ab ≥ cd ?” with application to finding a minimal cost reliability ratio spanning tree |
Chandrasekaran, R. |
1984 |
96-97 | Index 1 |
p. 117-123 7 p. |
artikel |
|
| 2678 | Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints |
Wojciechowski, Piotr |
|
96-97 | Index 1 |
p. 272-294 |
artikel |
|
| 2679 | Polynomial-time approximation algorithms for weighted LCS problem |
Cygan, M. |
2016 |
96-97 | Index 1 |
p. 38-48 11 p. |
artikel |
|
| 2680 | Polynomial-time equivalences and refined algorithms for longest common subsequence variants |
Asahiro, Yuichi |
|
96-97 | Index 1 |
p. 44-64 |
artikel |
|
| 2681 | Positive existential definability in finite structures |
Romov, Boris A. |
|
96-97 | Index 1 |
p. 210-215 |
artikel |
|
| 2682 | Positive feedback loops and multistationarity |
Thomas, R. |
1988 |
96-97 | Index 1 |
p. 381-396 16 p. |
artikel |
|
| 2683 | Positive matching decompositions of graphs |
Farrokhi D.G., Mohammad |
|
96-97 | Index 1 |
p. 311-323 |
artikel |
|
| 2684 | Positiveness of the permanent of 4-dimensional polystochastic matrices of order 4 |
Taranenko, A.A. |
|
96-97 | Index 1 |
p. 161-165 |
artikel |
|
| 2685 | Positive semidefiniteness of A α ( G ) on some families of graphs |
Brondani, A.E. |
|
96-97 | Index 1 |
p. 113-123 |
artikel |
|
| 2686 | Positive semidefinite propagation time |
Warnberg, Nathan |
2016 |
96-97 | Index 1 |
p. 274-290 17 p. |
artikel |
|
| 2687 | Positivity of second order linear recurrent sequences |
Halava, Vesa |
2006 |
96-97 | Index 1 |
p. 447-451 5 p. |
artikel |
|
| 2688 | Post classes characterized by functional terms |
Foldes, Stephan |
2004 |
96-97 | Index 1 |
p. 35-51 17 p. |
artikel |
|
| 2689 | Power domination in regular claw-free graphs |
Lu, Changhong |
|
96-97 | Index 1 |
p. 401-415 |
artikel |
|
| 2690 | (p − 1) (p + 1) -approximate algorithms for p-traveling salesmen problems on a tree with minmax objective |
Averbakh, Igor |
1997 |
96-97 | Index 1 |
p. 201-216 16 p. |
artikel |
|
| 2691 | Practical complexities of probabilistic algorithms for solving Boolean polynomial systems |
Barbero, Stefano |
|
96-97 | Index 1 |
p. 13-31 |
artikel |
|
| 2692 | Precoloring extension involving pairs of vertices of small distance |
Ojima, Chihoko |
2014 |
96-97 | Index 1 |
p. 170-177 8 p. |
artikel |
|
| 2693 | Precoloring extension on unit interval graphs |
Marx, Dániel |
2006 |
96-97 | Index 1 |
p. 995-1002 8 p. |
artikel |
|
| 2694 | Preface |
F. Janowitz, M. |
2003 |
96-97 | Index 1 |
p. 179-180 2 p. |
artikel |
|
| 2695 | Preface |
Borodin, Oleg |
2001 |
96-97 | Index 1 |
p. 1- 1 p. |
artikel |
|
| 2696 | Preface |
1986 |
96-97 | Index 1 |
p. 121- 1 p. |
artikel |
||
| 2697 | Prefix and suffix reversals on strings |
Fertin, Guillaume |
2018 |
96-97 | Index 1 |
p. 140-153 |
artikel |
|
| 2698 | Premature sets of 1-factors or how not to schedule round robin tournaments |
Rosa, Alexander |
1982 |
96-97 | Index 1 |
p. 291-297 7 p. |
artikel |
|
| 2699 | Prime power and prime product distance graphs |
Kaneda, Yumi |
2019 |
96-97 | Index 1 |
p. 334-338 |
artikel |
|
| 2700 | Priority-based bin packing with subset constraints |
Wojciechowski, Piotr |
|
96-97 | Index 1 |
p. 64-75 |
artikel |
|
| 2701 | Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem |
Franco, John |
1983 |
96-97 | Index 1 |
p. 77-87 11 p. |
artikel |
|
| 2702 | Probabilistic analysis of the subset-sum problem |
D'Atri, Gianfranco |
1982 |
96-97 | Index 1 |
p. 329-334 6 p. |
artikel |
|
| 2703 | Probabilistic analysis of two k-cluster problems |
Cooper, C. |
1994 |
96-97 | Index 1 |
p. 27-51 25 p. |
artikel |
|
| 2704 | Probabilities of dominant candidates based on first-place votes |
Fishburn, Peter C. |
1984 |
96-97 | Index 1 |
p. 131-140 10 p. |
artikel |
|
| 2705 | Probabilities within optimal strategies for tournament games |
Fisher, David C. |
1995 |
96-97 | Index 1 |
p. 87-91 5 p. |
artikel |
|
| 2706 | Probability of diameter two for Steinhaus graphs |
Brand, Neal |
1993 |
96-97 | Index 1 |
p. 165-171 7 p. |
artikel |
|
| 2707 | Progress towards the 1/2-Conjecture for the domination game |
Portier, Julien |
|
96-97 | Index 1 |
p. 36-43 |
artikel |
|
| 2708 | Proof of a conjecture concerning maximum general sum-connectivity index χ α of graphs with given cyclomatic number when 1 < α < 2 |
Tomescu, Ioan |
2019 |
96-97 | Index 1 |
p. 219-223 |
artikel |
|
| 2709 | Proof of a conjecture on isolation of graphs dominated by a vertex |
Borg, Peter |
|
96-97 | Index 1 |
p. 247-253 |
artikel |
|
| 2710 | Proof of a conjecture on the zero forcing number of a graph |
Lu, Leihao |
2016 |
96-97 | Index 1 |
p. 233-237 5 p. |
artikel |
|
| 2711 | Proof of Berge’s path partition conjecture for k ≥ λ − 3 |
Herskovics, Dávid |
2016 |
96-97 | Index 1 |
p. 137-143 7 p. |
artikel |
|
| 2712 | Proof of Stahl’s conjecture in some new cases |
Osztényi, József |
|
96-97 | Index 1 |
p. 113-118 |
artikel |
|
| 2713 | Proof of the first part of the conjecture of Aouchiche and Hansen about the Randić index |
Divnić, Tomica R. |
2013 |
96-97 | Index 1 |
p. 953-960 8 p. |
artikel |
|
| 2714 | Proofs of conjectures on the Randić index and average eccentricity |
Liang, Meili |
2016 |
96-97 | Index 1 |
p. 188-193 6 p. |
artikel |
|
| 2715 | Propagation time for zero forcing on a graph |
Hogben, Leslie |
2012 |
96-97 | Index 1 |
p. 1994-2005 12 p. |
artikel |
|
| 2716 | Proper conflict-free coloring of sparse graphs |
Cho, Eun-Kyung |
|
96-97 | Index 1 |
p. 34-42 |
artikel |
|
| 2717 | Properties of m-bonacci-sum graphs |
Mahalingam, Kalpana |
|
96-97 | Index 1 |
p. 149-158 |
artikel |
|
| 2718 | Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles |
Chen, Xiaozheng |
|
96-97 | Index 1 |
p. 167-180 |
artikel |
|
| 2719 | Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles |
Chen, Xiaozheng |
2019 |
96-97 | Index 1 |
p. 199-203 |
artikel |
|
| 2720 | Proportionally dense subgraph of maximum size: Complexity and approximation |
Bazgan, Cristina |
2019 |
96-97 | Index 1 |
p. 25-36 |
artikel |
|
| 2721 | Provably secure and efficient leakage-resilient certificateless signcryption scheme without bilinear pairing |
Zhou, Yanwei |
2016 |
96-97 | Index 1 |
p. 185-202 18 p. |
artikel |
|
| 2722 | Proving the conjecture of O’Donnell in certain cases and disproving its general validity |
Kudin, S. |
|
96-97 | Index 1 |
p. 345-353 |
artikel |
|
| 2723 | Proximity, remoteness and distance eigenvalues of a graph |
Aouchiche, Mustapha |
2016 |
96-97 | Index 1 |
p. 17-25 9 p. |
artikel |
|
| 2724 | Proximity, remoteness and minimum degree |
Dankelmann, Peter |
2015 |
96-97 | Index 1 |
p. 223-228 6 p. |
artikel |
|
| 2725 | Pseudoachromatic and connected-pseudoachromatic indices of the complete graph |
Araujo-Pardo, M. Gabriela |
2017 |
96-97 | Index 1 |
p. 60-66 7 p. |
artikel |
|
| 2726 | PTASs for secure dominating set in planar graphs and growth-bounded graphs |
Li, Ke |
|
96-97 | Index 1 |
p. 343-351 |
artikel |
|
| 2727 | Pure strategy solutions of the progressive discrete silent duel with generalized identical quadratic accuracy functions |
Romanuke, Vadim V. |
|
96-97 | Index 1 |
p. 215-232 |
artikel |
|
| 2728 | Pushdown–reduce: an algorithm for connectivity augmentation and poset covering problems |
Benczúr, András A. |
2003 |
96-97 | Index 1 |
p. 233-262 30 p. |
artikel |
|
| 2729 | Pyramidal tours with step-backs and the asymmetric traveling salesman problem |
Enomoto, Hikoe |
1998 |
96-97 | Index 1 |
p. 57-65 9 p. |
artikel |
|
| 2730 | Q -ary Rényi–Ulam pathological liar game with one lie |
Meng, Kun |
2011 |
96-97 | Index 1 |
p. 478-483 6 p. |
artikel |
|
| 2731 | q -cube enumerator polynomial of Fibonacci cubes |
Saygı, Elif |
2017 |
96-97 | Index 1 |
p. 127-137 11 p. |
artikel |
|
| 2732 | Q -Factorization of suffixes of two-way infinite extensions of irrational characteristic words |
Liao, Fang-Yi |
2017 |
96-97 | Index 1 |
p. 243-260 18 p. |
artikel |
|
| 2733 | Quadratic rotation symmetric Boolean functions |
Chirvasitu, Alexandru |
|
96-97 | Index 1 |
p. 91-105 |
artikel |
|
| 2734 | Quadratization of symmetric pseudo-Boolean functions |
Anthony, Martin |
2016 |
96-97 | Index 1 |
p. 1-12 12 p. |
artikel |
|
| 2735 | Quasi-centers and radius related to some iterated line digraphs, proofs of several conjectures on de Bruijn and Kautz graphs |
Lichiardopol, Nicolas |
2016 |
96-97 | Index 1 |
p. 106-110 5 p. |
artikel |
|
| 2736 | Quasi- λ -distance-balanced graphs |
Abedi, Amirabbas |
2017 |
96-97 | Index 1 |
p. 21-28 |
artikel |
|
| 2737 | Quasi-kernels in split graphs |
Langlois, Hélène |
|
96-97 | Index 1 |
p. 236-243 |
artikel |
|
| 2738 | Quasi-threshold graphs |
Jing-Ho, Yan |
1996 |
96-97 | Index 1 |
p. 247-255 9 p. |
artikel |
|
| 2739 | Query complexity of Boolean functions on the middle slice of the cube |
Gerbner, Dániel |
|
96-97 | Index 1 |
p. 43-49 |
artikel |
|
| 2740 | Queue layouts on folded hypercubes |
Geng, Xin |
|
96-97 | Index 1 |
p. 154-158 |
artikel |
|
| 2741 | Radio- k -labeling of cycles for large k |
Bloomfield, Colin |
|
96-97 | Index 1 |
p. 60-70 |
artikel |
|
| 2742 | Radio labelings of distance graphs |
Čada, Roman |
2013 |
96-97 | Index 1 |
p. 2876-2884 9 p. |
artikel |
|
| 2743 | Radio number for the Cartesian product of two trees |
Bantva, Devsi |
|
96-97 | Index 1 |
p. 304-316 |
artikel |
|
| 2744 | Radio number of trees |
Bantva, Devsi |
2017 |
96-97 | Index 1 |
p. 110-122 13 p. |
artikel |
|
| 2745 | Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions |
Das, Sandip |
|
96-97 | Index 1 |
p. 311-328 |
artikel |
|
| 2746 | Rainbow colouring of split graphs |
Chandran, L. Sunil |
2017 |
96-97 | Index 1 |
p. 98-113 16 p. |
artikel |
|
| 2747 | Rainbow connection and minimum degree |
Schiermeyer, Ingo |
2013 |
96-97 | Index 1 |
p. 1784-1787 4 p. |
artikel |
|
| 2748 | Rainbow connection number and graph operations |
Li, Hengzhe |
2017 |
96-97 | Index 1 |
p. 91-99 9 p. |
artikel |
|
| 2749 | Rainbow connections in digraphs |
Sidorowicz, Elżbieta |
2018 |
96-97 | Index 1 |
p. 248-261 |
artikel |
|
| 2750 | Rainbow connectivity of Moore cages of girth 6 |
Balbuena, C. |
2018 |
96-97 | Index 1 |
p. 104-109 |
artikel |
|
| 2751 | Rainbow domination and related problems on strongly chordal graphs |
Chang, Gerard J. |
2013 |
96-97 | Index 1 |
p. 1395-1401 7 p. |
artikel |
|
| 2752 | 2-rainbow domination in generalized Petersen graphs P ( n , 3 ) |
Xu, Guangjun |
2009 |
96-97 | Index 1 |
p. 2570-2573 4 p. |
artikel |
|
| 2753 | Rainbow domination in the lexicographic product of graphs |
Šumenjak, Tadeja Kraner |
2013 |
96-97 | Index 1 |
p. 2133-2141 9 p. |
artikel |
|
| 2754 | Rainbow domination numbers on graphs with given radius |
Fujita, Shinya |
2014 |
96-97 | Index 1 |
p. 115-122 8 p. |
artikel |
|
| 2755 | 2-rainbow domination of generalized Petersen graphs P ( n , 2 ) |
Tong, Chunling |
2009 |
96-97 | Index 1 |
p. 1932-1937 6 p. |
artikel |
|
| 2756 | Rainbow domination on trees |
Chang, Gerard J. |
2010 |
96-97 | Index 1 |
p. 8-12 5 p. |
artikel |
|
| 2757 | Rainbow independent sets in graphs with maximum degree two |
Ma, Yue |
|
96-97 | Index 1 |
p. 101-108 |
artikel |
|
| 2758 | Rainbow short linear forests in edge-colored complete graph |
He, Menglu |
|
96-97 | Index 1 |
p. 523-536 |
artikel |
|
| 2759 | Rainbow spanning trees in properly coloured complete graphs |
Balogh, József |
|
96-97 | Index 1 |
p. 97-101 |
artikel |
|
| 2760 | Rainbow transitive triangles in arc-colored digraphs |
Duan, Mengyu |
|
96-97 | Index 1 |
p. 175-184 |
artikel |
|
| 2761 | Rainbow triangles in arc-colored digraphs |
Li, Wei |
|
96-97 | Index 1 |
p. 169-180 |
artikel |
|
| 2762 | Ramsey and Gallai–Ramsey numbers for comb and sun graphs |
Xu, Xiao |
|
96-97 | Index 1 |
p. 131-145 |
artikel |
|
| 2763 | Ramsey and Gallai–Ramsey numbers for stars with extra independent edges |
Mao, Yaping |
|
96-97 | Index 1 |
p. 153-172 |
artikel |
|
| 2764 | Ramsey and Gallai–Ramsey numbers for the union of paths and stars |
Zhou, Jiannan |
|
96-97 | Index 1 |
p. 297-308 |
artikel |
|
| 2765 | Ramsey number of K 3 versus F 3 , n |
Hao, Yiyuan |
2018 |
96-97 | Index 1 |
p. 345-348 |
artikel |
|
| 2766 | Ramsey numbers of 4 -uniform loose cycles |
Omidi, G.R. |
2017 |
96-97 | Index 1 |
p. 112-120 9 p. |
artikel |
|
| 2767 | Ramsey-remainder for convex sets and the Erdős–Szekeres theorem |
Károlyi, Gyula |
2001 |
96-97 | Index 1 |
p. 163-175 13 p. |
artikel |
|
| 2768 | Randić index and coloring number of a graph |
Wu, Baoyindureng |
2014 |
96-97 | Index 1 |
p. 163-165 3 p. |
artikel |
|
| 2769 | Randić ordering of chemical trees |
Rada, Juan |
2005 |
96-97 | Index 1 |
p. 232-250 19 p. |
artikel |
|
| 2770 | Random bipartite Ramsey numbers of long cycles |
Liu, Meng |
|
96-97 | Index 1 |
p. 39-47 |
artikel |
|
| 2771 | Randomized algorithms for finding the shortest negative cost cycle in networks |
Orlin, James B. |
2018 |
96-97 | Index 1 |
p. 387-394 |
artikel |
|
| 2772 | Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks |
Berman, Piotr |
2007 |
96-97 | Index 1 |
p. 733-749 17 p. |
artikel |
|
| 2773 | Randomized vs. deterministic distance query strategies for point location on the line |
Damaschke, Peter |
2006 |
96-97 | Index 1 |
p. 478-484 7 p. |
artikel |
|
| 2774 | Random walks and electrical resistances in products of graphs |
Bollobás, Béla |
1997 |
96-97 | Index 1 |
p. 69-79 11 p. |
artikel |
|
| 2775 | Random walks with absorbing points |
Shapiro, Louis |
1992 |
96-97 | Index 1 |
p. 57-67 11 p. |
artikel |
|
| 2776 | Ranking the vertices of a complete multipartite paired comparison digraph |
Gutin, Gregory |
1996 |
96-97 | Index 1 |
p. 75-82 8 p. |
artikel |
|
| 2777 | Ratewise-optimal non-sequential search strategies under constraints on the tests |
Ahlswede, Rudolf |
2008 |
96-97 | Index 1 |
p. 1431-1443 13 p. |
artikel |
|
| 2778 | r -dynamic colorings and the spectral radius in graphs |
Ai, Jiangdong |
|
96-97 | Index 1 |
p. 249-255 |
artikel |
|
| 2779 | Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problem |
Guíñez, F. |
2011 |
96-97 | Index 1 |
p. 23-30 8 p. |
artikel |
|
| 2780 | Real royal road functions—where crossover provably is essential |
Jansen, Thomas |
2005 |
96-97 | Index 1 |
p. 111-125 15 p. |
artikel |
|
| 2781 | Reciprocal complementary Wiener numbers of trees, unicyclic graphs and bicyclic graphs |
Cai, Xiaochun |
2009 |
96-97 | Index 1 |
p. 3046-3054 9 p. |
artikel |
|
| 2782 | Reciprocal degree distance of product graphs |
Pattabiraman, K. |
2014 |
96-97 | Index 1 |
p. 201-213 13 p. |
artikel |
|
| 2783 | Recognizing clique graphs of directed and rooted path graphs |
Prisner, Erich |
1999 |
96-97 | Index 1 |
p. 321-328 8 p. |
artikel |
|
| 2784 | Recognizing DNA graphs is difficult |
Pendavingh, Rudi |
2003 |
96-97 | Index 1 |
p. 85-94 10 p. |
artikel |
|
| 2785 | Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7 |
Tankus, David |
|
96-97 | Index 1 |
p. 189-198 |
artikel |
|
| 2786 | Recognizing near-bipartite Pfaffian graphs in polynomial time |
Miranda, Alberto Alexandre Assis |
2010 |
96-97 | Index 1 |
p. 1275-1278 4 p. |
artikel |
|
| 2787 | Recognizing renamable generalized propositional Horn formulas is NP-complete |
Eiter, Thomas |
1995 |
96-97 | Index 1 |
p. 23-31 9 p. |
artikel |
|
| 2788 | Recognizing single-peaked preferences on an arbitrary graph: Complexity and algorithms |
Escoffier, Bruno |
|
96-97 | Index 1 |
p. 301-319 |
artikel |
|
| 2789 | Recognizing tough graphs is NP-hard |
Bauer, D. |
1990 |
96-97 | Index 1 |
p. 191-195 5 p. |
artikel |
|
| 2790 | Recognizing vertex intersection graphs of paths on bounded degree trees |
Alcón, L. |
2014 |
96-97 | Index 1 |
p. 70-77 8 p. |
artikel |
|
| 2791 | Recoloring some hereditary graph classes |
Belavadi, Manoj |
|
96-97 | Index 1 |
p. 389-401 |
artikel |
|
| 2792 | Reconstruction of domino tilings—Combinatorial and probabilistic questions |
Bar-Sinai, Yoav |
2016 |
96-97 | Index 1 |
p. 1-19 19 p. |
artikel |
|
| 2793 | Reconstruction of hv-convex binary matrices from their absorbed projections |
Kuba, Attila |
2004 |
96-97 | Index 1 |
p. 137-148 12 p. |
artikel |
|
| 2794 | Reconstruction of permutations distorted by reversal errors |
Konstantinova, Elena |
2007 |
96-97 | Index 1 |
p. 2426-2434 9 p. |
artikel |
|
| 2795 | Record statistics in a random composition |
Knopfmacher, Arnold |
2012 |
96-97 | Index 1 |
p. 593-603 11 p. |
artikel |
|
| 2796 | Rectilinear path problems in restricted memory setup |
Bhattacharya, Binay K. |
2017 |
96-97 | Index 1 |
p. 80-87 8 p. |
artikel |
|
| 2797 | Recursive constructions of N -polynomials over GF ( 2 s ) |
Kyuregyan, Melsik K. |
2008 |
96-97 | Index 1 |
p. 1554-1559 6 p. |
artikel |
|
| 2798 | Redicolouring digraphs: Directed treewidth and cycle-degeneracy |
Nisse, Nicolas |
|
96-97 | Index 1 |
p. 191-208 |
artikel |
|
| 2799 | Reduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computations |
Sherali, Hanif D. |
2000 |
96-97 | Index 1 |
p. 247-267 21 p. |
artikel |
|
| 2800 | Reducibility number |
Kharat, V.S. |
2007 |
96-97 | Index 1 |
p. 2069-2076 8 p. |
artikel |
|
| 2801 | Re-1-embeddings of optimal 1-embedded graphs on the projective plane |
Suzuki, Yusuke |
|
96-97 | Index 1 |
p. 487-496 |
artikel |
|
| 2802 | Reflectiveness and compression of threshold transformations |
Ueda, Takao |
2000 |
96-97 | Index 1 |
p. 215-224 10 p. |
artikel |
|
| 2803 | 0–1 reformulations of the multicommodity capacitated network design problem |
Frangioni, Antonio |
2009 |
96-97 | Index 1 |
p. 1229-1241 13 p. |
artikel |
|
| 2804 | Regular homogeneously traceable nonhamiltonian graphs |
Hu, Yanan |
|
96-97 | Index 1 |
p. 60-64 |
artikel |
|
| 2805 | Regular intersecting families |
Ihringer, Ferdinand |
2019 |
96-97 | Index 1 |
p. 142-152 |
artikel |
|
| 2806 | Regularity of matrices in min-algebra and its time- complexity |
Butkovič, P. |
1995 |
96-97 | Index 1 |
p. 121-132 12 p. |
artikel |
|
| 2807 | Relating dissociation, independence, and matchings |
Bock, Felix |
|
96-97 | Index 1 |
p. 160-165 |
artikel |
|
| 2808 | Relating multiway discrepancy and singular values of nonnegative rectangular matrices |
Bolla, Marianna |
2016 |
96-97 | Index 1 |
p. 26-34 9 p. |
artikel |
|
| 2809 | Relating the annihilation number and the 2-domination number of block graphs |
Jakovac, Marko |
2019 |
96-97 | Index 1 |
p. 178-187 |
artikel |
|
| 2810 | Relating the annihilation number and the total domination number for some graphs |
Hua, Xinying |
|
96-97 | Index 1 |
p. 41-46 |
artikel |
|
| 2811 | Relating the total { 2 } -domination number with the total domination number of graphs |
Ríos Villamar, I. |
|
96-97 | Index 1 |
p. 90-95 |
artikel |
|
| 2812 | Relation between the H-rank of a mixed graph and the girth of its underlying graph |
Khan, Suliman |
|
96-97 | Index 1 |
p. 239-248 |
artikel |
|
| 2813 | Relation between the nullity of a graph and its matching number |
Zhou, Qi |
|
96-97 | Index 1 |
p. 93-98 |
artikel |
|
| 2814 | Relations between global forcing number and maximum anti-forcing number of a graph |
Zhang, Yaxian |
|
96-97 | Index 1 |
p. 85-96 |
artikel |
|
| 2815 | Relationship between the edge-Wiener index and the Gutman index of a graph |
Knor, Martin |
2014 |
96-97 | Index 1 |
p. 197-201 5 p. |
artikel |
|
| 2816 | Relaxed voting and competitive location under monotonous gain functions on trees |
Spoerhase, J. |
2010 |
96-97 | Index 1 |
p. 361-373 13 p. |
artikel |
|
| 2817 | Reliability analyses of regular graphs based on edge-structure connectivity |
Wang, Na |
|
96-97 | Index 1 |
p. 329-342 |
artikel |
|
| 2818 | Reliability analysis of 3-ary n -cube in terms of average degree edge-connectivity |
Zhang, Qifan |
|
96-97 | Index 1 |
p. 31-39 |
artikel |
|
| 2819 | Reliability analysis of Cayley graphs generated by transpositions |
Gu, Mei-Mei |
2018 |
96-97 | Index 1 |
p. 94-102 |
artikel |
|
| 2820 | Reliability analysis of exchanged hypercubes based on the path connectivity |
Zhu, Wen-Han |
|
96-97 | Index 1 |
p. 404-416 |
artikel |
|
| 2821 | Reliability analysis of godan graphs in terms of generalized 4-connectivity |
Wang, Jing |
|
96-97 | Index 1 |
p. 210-223 |
artikel |
|
| 2822 | Reliability evaluation of DQcube based on g-good neighbor and g-component fault pattern |
Zhang, Hong |
|
96-97 | Index 1 |
p. 179-190 |
artikel |
|
| 2823 | Reliability measure of multiprocessor system based on enhanced hypercubes |
Xu, Liqiong |
|
96-97 | Index 1 |
p. 125-138 |
artikel |
|
| 2824 | Reliability of m -ary n -dimensional hypercubes under embedded restriction |
Zhao, Ying-Ze |
|
96-97 | Index 1 |
p. 182-189 |
artikel |
|
| 2825 | Reliable broadcasting in product networks |
Bao, Feng |
1998 |
96-97 | Index 1 |
p. 3-20 18 p. |
artikel |
|
| 2826 | Remarks on odd colorings of graphs |
Caro, Yair |
|
96-97 | Index 1 |
p. 392-401 |
artikel |
|
| 2827 | Remarks on planar edge-chromatic critical graphs |
Jin, Ligang |
2016 |
96-97 | Index 1 |
p. 200-202 3 p. |
artikel |
|
| 2828 | Remarks on restricted fractional ( g , f ) -factors in graphs |
Zhou, Sizhong |
|
96-97 | Index 1 |
p. 271-278 |
artikel |
|
| 2829 | Remarks on the upper bound for the Randić energy of bipartite graphs |
Glogić, Edin |
2017 |
96-97 | Index 1 |
p. 67-70 4 p. |
artikel |
|
| 2830 | Remoteness and distance eigenvalues of a graph |
Lin, Huiqiu |
2016 |
96-97 | Index 1 |
p. 218-224 7 p. |
artikel |
|
| 2831 | Removable and forced subgraphs of graphs |
Chen, Wuxian |
|
96-97 | Index 1 |
p. 23-35 |
artikel |
|
| 2832 | Removable edges in Halin graphs |
Wang, Yan |
|
96-97 | Index 1 |
p. 1-7 |
artikel |
|
| 2833 | Renting servers in the cloud: The case of equal duration jobs |
Masoori, Mahtab |
|
96-97 | Index 1 |
p. 82-99 |
artikel |
|
| 2834 | Reoptimizing the 0–1 knapsack problem |
Archetti, Claudia |
2010 |
96-97 | Index 1 |
p. 1879-1887 9 p. |
artikel |
|
| 2835 | Representability of functions |
Jeroslow, R.G. |
1989 |
96-97 | Index 1 |
p. 125-137 13 p. |
artikel |
|
| 2836 | Representations of bicircular matroids |
Coullard, Collette R. |
1991 |
96-97 | Index 1 |
p. 223-240 18 p. |
artikel |
|
| 2837 | Representative graphs of r-regular partial planes and representation of orthomodular posets |
Anger, F.D. |
1986 |
96-97 | Index 1 |
p. 1-10 10 p. |
artikel |
|
| 2838 | Resilience and optimization of identifiable bipartite graphs |
Fritzilas, Epameinondas |
2013 |
96-97 | Index 1 |
p. 593-603 11 p. |
artikel |
|
| 2839 | Resistance distance and Kirchhoff index in dihedral Cayley graphs |
Huang, Jing |
|
96-97 | Index 1 |
p. 125-134 |
artikel |
|
| 2840 | Resistance distance and Kirchhoff index of R -vertex join and R -edge join of two graphs |
Liu, Xiaogang |
2015 |
96-97 | Index 1 |
p. 130-139 10 p. |
artikel |
|
| 2841 | Resistance distance in complete n -partite graphs |
Gervacio, Severino V. |
2016 |
96-97 | Index 1 |
p. 53-61 9 p. |
artikel |
|
| 2842 | Resistance distance in connected balanced digraphs |
Balakrishnan, R. |
|
96-97 | Index 1 |
p. 46-53 |
artikel |
|
| 2843 | Resistance distance in straight linear 2-trees |
Barrett, Wayne |
2019 |
96-97 | Index 1 |
p. 13-34 |
artikel |
|
| 2844 | Resistance distances in generalized join graphs |
Xu, Shaohan |
|
96-97 | Index 1 |
p. 18-33 |
artikel |
|
| 2845 | Resolution and binary decision diagrams cannot simulate each other polynomially |
Groote, J.F. |
2003 |
96-97 | Index 1 |
p. 157-171 15 p. |
artikel |
|
| 2846 | Resolving dominating partitions in graphs |
Hernando, Carmen |
2019 |
96-97 | Index 1 |
p. 237-251 |
artikel |
|
| 2847 | Resolving prime modules: The structure of pseudo-cographs and galled-tree explainable graphs |
Hellmuth, Marc |
|
96-97 | Index 1 |
p. 25-43 |
artikel |
|
| 2848 | 2-resonance of plane bipartite graphs and its applications to boron–nitrogen fullerenes |
Zhang, Heping |
2010 |
96-97 | Index 1 |
p. 1559-1569 11 p. |
artikel |
|
| 2849 | Resource augmented semi-online bounded space bin packing |
Epstein, Leah |
2009 |
96-97 | Index 1 |
p. 2785-2798 14 p. |
artikel |
|
| 2850 | Restrained Roman and restrained Italian domatic numbers of graphs |
Volkmann, Lutz |
|
96-97 | Index 1 |
p. 153-159 |
artikel |
|
| 2851 | Restraints permitting the largest number of colourings |
Brown, Jason |
2017 |
96-97 | Index 1 |
p. 76-88 13 p. |
artikel |
|
| 2852 | Restricted arc-connectivity in tournaments |
Grüter, Steffen |
2013 |
96-97 | Index 1 |
p. 1467-1471 5 p. |
artikel |
|
| 2853 | Restricted arc-connectivity of bipartite tournaments |
Grüter, Steffen |
2013 |
96-97 | Index 1 |
p. 2008-2013 6 p. |
artikel |
|
| 2854 | Restricted arc-connectivity of generalized p -cycles |
Balbuena, C. |
2012 |
96-97 | Index 1 |
p. 1325-1332 8 p. |
artikel |
|
| 2855 | Restricted connectivity of Cayley graph generated by transposition trees |
Zhang, Hong |
|
96-97 | Index 1 |
p. 87-95 |
artikel |
|
| 2856 | Restricted cycle factors and arc-decompositions of digraphs |
Bang-Jensen, Jørgen |
2015 |
96-97 | Index 1 |
p. 80-93 14 p. |
artikel |
|
| 2857 | Restricted domination in Quasi-transitive and 3-Quasi-transitive digraphs |
López-Ortiz, Marco Antonio |
|
96-97 | Index 1 |
p. 352-364 |
artikel |
|
| 2858 | Restricted non-separable planar maps and some pattern avoiding permutations |
Kitaev, Sergey |
2013 |
96-97 | Index 1 |
p. 2514-2526 13 p. |
artikel |
|
| 2859 | Restricted optimal pebbling is NP-hard |
Papp, László F. |
|
96-97 | Index 1 |
p. 258-263 |
artikel |
|
| 2860 | Restricted power domination and fault-tolerant power domination on grids |
Pai, Kung-Jui |
2010 |
96-97 | Index 1 |
p. 1079-1089 11 p. |
artikel |
|
| 2861 | Results about the total chromatic number and the conformability of some families of circulant graphs |
Faria, Luerbio |
|
96-97 | Index 1 |
p. 123-133 |
artikel |
|
| 2862 | Reverse 2-median problem on trees |
Burkard, Rainer E. |
2008 |
96-97 | Index 1 |
p. 1963-1976 14 p. |
artikel |
|
| 2863 | Reverse search for enumeration |
Avis, David |
1996 |
96-97 | Index 1 |
p. 21-46 26 p. |
artikel |
|
| 2864 | Reversible complement cyclic codes over Galois rings with application to DNA codes |
Kaur, Jasbir |
|
96-97 | Index 1 |
p. 162-170 |
artikel |
|
| 2865 | Revisiting Prime Power RSA |
Sarkar, Santanu |
2016 |
96-97 | Index 1 |
p. 127-133 7 p. |
artikel |
|
| 2866 | Richard Isaac, the pleasures of probability (Springer, New York, 1995) 241 pages |
1997 |
96-97 | Index 1 |
p. 192- 1 p. |
artikel |
||
| 2867 | Richardson’s Theorem for k -colored kernels in strongly connected digraphs |
Galeana-Sánchez, Hortensia |
2016 |
96-97 | Index 1 |
p. 47-52 6 p. |
artikel |
|
| 2868 | Right angle crossing graphs and 1-planarity |
Eades, Peter |
2013 |
96-97 | Index 1 |
p. 961-969 9 p. |
artikel |
|
| 2869 | Rime: Repeat identification |
Federico, Maria |
2014 |
96-97 | Index 1 |
p. 275-286 12 p. |
artikel |
|
| 2870 | RNA pseudoknot structures with arc-length ≥ 3 and stack-length ≥ σ |
Jin, Emma Y. |
2010 |
96-97 | Index 1 |
p. 25-36 12 p. |
artikel |
|
| 2871 | Rényi–Berlekamp–Ulam searching game with bi-interval queries and two lies |
Xing, Shu Min |
2016 |
96-97 | Index 1 |
p. 8-18 11 p. |
artikel |
|
| 2872 | Robotic cell scheduling with operational flexibility |
Akturk, M.Selim |
2005 |
96-97 | Index 1 |
p. 334-348 15 p. |
artikel |
|
| 2873 | Robust cycle bases do not exist for K n , n if n ≥ 8 |
Hammack, Richard H. |
2018 |
96-97 | Index 1 |
p. 206-211 |
artikel |
|
| 2874 | Robust recoverable and two-stage selection problems |
Kasperski, Adam |
2017 |
96-97 | Index 1 |
p. 52-64 13 p. |
artikel |
|
| 2875 | Role coloring bipartite graphs |
Pandey, Sukanya |
|
96-97 | Index 1 |
p. 276-285 |
artikel |
|
| 2876 | Roman { 2 } -domination |
Chellali, Mustapha |
2016 |
96-97 | Index 1 |
p. 22-28 7 p. |
artikel |
|
| 2877 | Roman domination and independent Roman domination on graphs with maximum degree three |
Luiz, Atílio G. |
|
96-97 | Index 1 |
p. 260-278 |
artikel |
|
| 2878 | Roman { 3 } -domination (double Italian domination) |
Mojdeh, Doost Ali |
|
96-97 | Index 1 |
p. 555-564 |
artikel |
|
| 2879 | Roman {3}-domination in graphs: Complexity and algorithms |
Chaudhary, Juhi |
|
96-97 | Index 1 |
p. 301-325 |
artikel |
|
| 2880 | Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks |
Erdős, Péter L. |
|
96-97 | Index 1 |
p. 205-213 |
artikel |
|
| 2881 | Rotation symmetric Boolean functions—Count and cryptographic properties |
Stănică, Pantelimon |
2008 |
96-97 | Index 1 |
p. 1567-1580 14 p. |
artikel |
|
| 2882 | Rounds in a combinatorial search problem |
Gerbner, Dániel |
|
96-97 | Index 1 |
p. 60-68 |
artikel |
|
| 2883 | Routing permutations and 2–1 routing requests in the hypercube |
Baudon, Olivier |
2001 |
96-97 | Index 1 |
p. 43-58 16 p. |
artikel |
|
| 2884 | Routing to reduce the cost of wavelength conversion |
Erlebach, Thomas |
2008 |
96-97 | Index 1 |
p. 2911-2923 |
artikel |
|
| 2885 | Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI |
Recski, András |
2007 |
96-97 | Index 1 |
p. 44-52 9 p. |
artikel |
|
| 2886 | Safe sets and in-dominating sets in digraphs |
Bai, Yandong |
|
96-97 | Index 1 |
p. 215-227 |
artikel |
|
| 2887 | Sandwiching the (generalized) Randić index |
Knor, Martin |
2015 |
96-97 | Index 1 |
p. 160-166 7 p. |
artikel |
|
| 2888 | SAT distributions with planted assignments and phase transitions between decision and optimization problems |
Dimitriou, Tassos |
2005 |
96-97 | Index 1 |
p. 58-72 15 p. |
artikel |
|
| 2889 | Saturated boundary k -alliances in graphs |
Slimani, Hachem |
2015 |
96-97 | Index 1 |
p. 192-207 16 p. |
artikel |
|
| 2890 | Saturation numbers for t P k with k less than 6 |
Cao, Shujuan |
|
96-97 | Index 1 |
p. 108-119 |
artikel |
|
| 2891 | Saturation numbers of joins of graphs |
Hu, Sinan |
|
96-97 | Index 1 |
p. 300-309 |
artikel |
|
| 2892 | Scheduling dyadic intervals |
Driscoll, James R. |
1995 |
96-97 | Index 1 |
p. 101-116 16 p. |
artikel |
|
| 2893 | Scheduling imprecise computation tasks with 0 1 -constraint |
Ho, Kevin I-J. |
1997 |
96-97 | Index 1 |
p. 117-132 16 p. |
artikel |
|
| 2894 | Scheduling jobs with equal processing times and a single server on parallel identical machines |
Zhang, An |
2016 |
96-97 | Index 1 |
p. 196-206 11 p. |
artikel |
|
| 2895 | Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines |
Furmańczyk, Hanna |
2018 |
96-97 | Index 1 |
p. 210-217 |
artikel |
|
| 2896 | Scheduling problem with multi-purpose parallel machines |
Rodrigues, Rosiane de Freitas |
2014 |
96-97 | Index 1 |
p. 313-319 7 p. |
artikel |
|
| 2897 | Scheduling tasks with exponential duration on unrelated parallel machines |
Nouri, Mostafa |
2012 |
96-97 | Index 1 |
p. 2462-2473 12 p. |
artikel |
|
| 2898 | Scheduling with batching: two job types |
Hochbaum, Dorit S. |
1997 |
96-97 | Index 1 |
p. 99-114 16 p. |
artikel |
|
| 2899 | Scheduling with incompatible jobs |
Bodlaender, Hans L. |
1994 |
96-97 | Index 1 |
p. 219-232 14 p. |
artikel |
|
| 2900 | Scientific contributions of Leo Khachiyan (a short overview) |
Boros, Endre |
2008 |
96-97 | Index 1 |
p. 2232-2240 9 p. |
artikel |
|
| 2901 | s-Club Cluster Vertex Deletion on interval and well-partitioned chordal graphs |
Chakraborty, Dibyayan |
|
96-97 | Index 1 |
p. 170-189 |
artikel |
|
| 2902 | Screw discrete dynamical systems and their applications to exact slow NIM |
Gurvich, Vladimir |
|
96-97 | Index 1 |
p. 382-394 |
artikel |
|
| 2903 | Searching for a counterfeit coin with b-balance |
Liu, Wen An |
2006 |
96-97 | Index 1 |
p. 2010-2023 14 p. |
artikel |
|
| 2904 | Searching for mobile intruders in circular corridors by two 1-searchers |
Jiang, Bo |
2011 |
96-97 | Index 1 |
p. 1793-1805 13 p. |
artikel |
|
| 2905 | Searching for two counterfeit coins with two-arms balance |
Liu, Wen An |
2005 |
96-97 | Index 1 |
p. 187-212 26 p. |
artikel |
|
| 2906 | Searching with lies under error cost constraints |
Ahlswede, Rudolf |
2008 |
96-97 | Index 1 |
p. 1444-1460 17 p. |
artikel |
|
| 2907 | Search problems for two irregular coins with incomplete feedback: the underweight model |
Gargano, L. |
1992 |
96-97 | Index 1 |
p. 191-197 7 p. |
artikel |
|
| 2908 | Second neighborhood via probabilistic argument |
Xia, Weihao |
|
96-97 | Index 1 |
p. 49-54 |
artikel |
|
| 2909 | Second Siam Symposium on the Applications of Discrete Mathematics |
1983 |
96-97 | Index 1 |
p. 251-252 2 p. |
artikel |
||
| 2910 | Secure total domination in graphs: Bounds and complexity |
Duginov, Oleg |
2017 |
96-97 | Index 1 |
p. 97-108 12 p. |
artikel |
|
| 2911 | Segmental solutions of Boolean equations |
Brown, Frank Markham |
1982 |
96-97 | Index 1 |
p. 87-96 10 p. |
artikel |
|
| 2912 | Selecting and covering colored points |
Arkin, Esther M. |
2018 |
96-97 | Index 1 |
p. 75-86 |
artikel |
|
| 2913 | Self-duality of bounded monotone boolean functions and related problems |
Ram Gaur, Daya |
2008 |
96-97 | Index 1 |
p. 1598-1605 8 p. |
artikel |
|
| 2914 | Semi-online scheduling jobs with tightly-grouped processing times on three identical machines |
He, Yong |
2005 |
96-97 | Index 1 |
p. 140-159 20 p. |
artikel |
|
| 2915 | Semi-online scheduling on two identical machines with a common due date to maximize total early work |
Chen, Xin |
|
96-97 | Index 1 |
p. 71-78 |
artikel |
|
| 2916 | Semi-proper orientations of dense graphs |
Araújo, Júlio |
|
96-97 | Index 1 |
p. 196-217 |
artikel |
|
| 2917 | Sensitivity analysis of list scheduling heuristics |
Kolen, A.W.J. |
1994 |
96-97 | Index 1 |
p. 145-162 18 p. |
artikel |
|
| 2918 | Separating signatures in signed planar graphs |
Naserasr, Reza |
|
96-97 | Index 1 |
p. 302-310 |
artikel |
|
| 2919 | Separator-based graph embedding into multidimensional grids with small edge-congestion |
Matsubayashi, Akira |
2015 |
96-97 | Index 1 |
p. 119-137 19 p. |
artikel |
|
| 2920 | Sequence saturation |
Anand, |
|
96-97 | Index 1 |
p. 382-393 |
artikel |
|
| 2921 | Sequences of radius k for complete bipartite graphs |
Dębski, Michał |
2017 |
96-97 | Index 1 |
p. 51-63 13 p. |
artikel |
|
| 2922 | Serial exchanges in random bases |
McGuinness, Sean |
|
96-97 | Index 1 |
p. 103-110 |
artikel |
|
| 2923 | Series–parallel chromatic hypergraphs |
Tomescu, Ioan |
2010 |
96-97 | Index 1 |
p. 198-203 6 p. |
artikel |
|
| 2924 | Set and size multipartite Ramsey numbers for stars |
Perondi, Pablo H. |
2018 |
96-97 | Index 1 |
p. 368-372 |
artikel |
|
| 2925 | Set graphs. IV. Further connections with claw-freeness |
Milanič, Martin |
2014 |
96-97 | Index 1 |
p. 113-121 9 p. |
artikel |
|
| 2926 | [ 1 , 2 ] -sets and [ 1 , 2 ] -total sets in trees with algorithms |
Goharshady, A.K. |
2016 |
96-97 | Index 1 |
p. 136-146 11 p. |
artikel |
|
| 2927 | [1, 2]-sets in graphs |
Chellali, Mustapha |
2013 |
96-97 | Index 1 |
p. 2885-2893 9 p. |
artikel |
|
| 2928 | Settlement fund circulation problem |
Hayakawa, Hitoshi |
2019 |
96-97 | Index 1 |
p. 86-103 |
artikel |
|
| 2929 | Several classes of PcN power functions over finite fields |
Wang, Xiaoqiang |
|
96-97 | Index 1 |
p. 171-182 |
artikel |
|
| 2930 | Several families with incomparability and complementarity conditions |
Goldwasser, John |
2019 |
96-97 | Index 1 |
p. 103-110 |
artikel |
|
| 2931 | Sharp bounds for the Chinese Postman Problem in 3-regular graphs and multigraphs |
O, Suil |
2015 |
96-97 | Index 1 |
p. 163-168 6 p. |
artikel |
|
| 2932 | Sharp bounds for the Randić index of graphs with given minimum and maximum degree |
O, Suil |
|
96-97 | Index 1 |
p. 111-115 |
artikel |
|
| 2933 | Sharp bounds for the Zagreb indices of bicyclic graphs with k -pendant vertices |
Zhao, Qin |
2010 |
96-97 | Index 1 |
p. 1953-1962 10 p. |
artikel |
|
| 2934 | Sharp bounds of the zeroth-order general Randić index of bicyclic graphs with given pendent vertices |
Pan, Xiang-Feng |
2011 |
96-97 | Index 1 |
p. 240-245 6 p. |
artikel |
|
| 2935 | Sharp bounds on the reduced second Zagreb index of graphs with given number of cut vertices |
He, Xiaocong |
2019 |
96-97 | Index 1 |
p. 49-63 |
artikel |
|
| 2936 | Sharp lower bounds on the fractional matching number |
Behrend, Roger E. |
2015 |
96-97 | Index 1 |
p. 272-274 3 p. |
artikel |
|
| 2937 | Shortcutting directed and undirected networks with a degree constraint |
Tan, Richard B. |
2017 |
96-97 | Index 1 |
p. 91-117 27 p. |
artikel |
|
| 2938 | Shortened universal cycles for permutations |
Kirsch, Rachel |
|
96-97 | Index 1 |
p. 219-228 |
artikel |
|
| 2939 | Shortest-path problems and molecular conformation |
Dress, Andreas W.M. |
1988 |
96-97 | Index 1 |
p. 129-144 16 p. |
artikel |
|
| 2940 | Shortest paths in Sierpiński graphs |
Xue, Bing |
2014 |
96-97 | Index 1 |
p. 314-321 8 p. |
artikel |
|
| 2941 | Short proof of a discrete gronwall inequality |
Clark, Dean S |
1987 |
96-97 | Index 1 |
p. 279-281 3 p. |
artikel |
|
| 2942 | Short signed circuit covers of signed graphs |
Chen, Jing |
2018 |
96-97 | Index 1 |
p. 51-58 |
artikel |
|
| 2943 | Shuffling matrices, Kronecker product and Discrete Fourier Transform |
D’Angeli, Daniele |
2017 |
96-97 | Index 1 |
p. 1-18 18 p. |
artikel |
|
| 2944 | Signed analogue of general Kotzig–Lovász decomposition |
Kita, Nanao |
|
96-97 | Index 1 |
p. 61-70 |
artikel |
|
| 2945 | Signed domatic number of a graph |
Volkmann, Lutz |
2005 |
96-97 | Index 1 |
p. 261-267 7 p. |
artikel |
|
| 2946 | Signed double Roman domination in graphs |
Ahangar, Hossein Abdollahzadeh |
2019 |
96-97 | Index 1 |
p. 1-11 |
artikel |
|
| 2947 | Signed graphs |
Zaslavsky, Thomas |
1983 |
96-97 | Index 1 |
p. 248- 1 p. |
artikel |
|
| 2948 | Signed Roman k -domination in trees |
Henning, Michael A. |
2015 |
96-97 | Index 1 |
p. 98-105 8 p. |
artikel |
|
| 2949 | Signed star domatic number of a graph |
Atapour, M. |
2010 |
96-97 | Index 1 |
p. 213-218 6 p. |
artikel |
|
| 2950 | Signed star k -subdomination numbers in graphs |
Saei, Reza |
2008 |
96-97 | Index 1 |
p. 3066-3070 |
artikel |
|
| 2951 | Simple but efficient approaches for the collapsing knapsack problem |
Pferschy, Ulrich |
1997 |
96-97 | Index 1 |
p. 271-280 10 p. |
artikel |
|
| 2952 | Simple cubic graphs with no short traveling salesman tour |
Lukoťka, Robert |
2018 |
96-97 | Index 1 |
p. 218-222 |
artikel |
|
| 2953 | Simplified existence theorems on all fractional [ a , b ] -factors |
Lu, Hongliang |
2013 |
96-97 | Index 1 |
p. 2075-2078 4 p. |
artikel |
|
| 2954 | Single-peaked preferences over multidimensional binary alternatives |
Brown, Lindsey |
2014 |
96-97 | Index 1 |
p. 14-25 12 p. |
artikel |
|
| 2955 | Singularities in Negami’s splitting formula for the Tutte polynomial |
Burgos, J.M. |
2018 |
96-97 | Index 1 |
p. 65-74 |
artikel |
|
| 2956 | Size of random Galois lattices and number of closed frequent itemsets |
Emilion, Richard |
2009 |
96-97 | Index 1 |
p. 2945-2957 13 p. |
artikel |
|
| 2957 | Skeleton matching polytope: Realization and isomorphism |
Abreu, Nair |
2019 |
96-97 | Index 1 |
p. 27-31 |
artikel |
|
| 2958 | Slack matrices, k -products, and 2-level polytopes |
Aprile, Manuel |
|
96-97 | Index 1 |
p. 199-213 |
artikel |
|
| 2959 | Slow coloring of 3 k -connected graphs |
Morris, Joan M. |
|
96-97 | Index 1 |
p. 226-230 |
artikel |
|
| 2960 | Small alliances in a weighted graph |
Kimura, Kenji |
2010 |
96-97 | Index 1 |
p. 2071-2074 4 p. |
artikel |
|
| 2961 | Small components in k -nearest neighbour graphs |
Walters, Mark |
2012 |
96-97 | Index 1 |
p. 2037-2047 11 p. |
artikel |
|
| 2962 | Small cycles in Hamiltonian graphs |
Schelten, Uwe |
1997 |
96-97 | Index 1 |
p. 201-211 11 p. |
artikel |
|
| 2963 | Small ℓ -edge-covers in k -connected graphs |
Nutov, Zeev |
2013 |
96-97 | Index 1 |
p. 2101-2106 6 p. |
artikel |
|
| 2964 | Smallest C 2 ℓ + 1 -critical graphs of odd-girth 2 k + 1 |
Beaudou, Laurent |
|
96-97 | Index 1 |
p. 564-575 |
artikel |
|
| 2965 | Solitaire Clobber played on Cartesian product of graphs |
Dantas, Simone |
2015 |
96-97 | Index 1 |
p. 84-90 7 p. |
artikel |
|
| 2966 | Solution techniques for the Large Set Covering Problem |
Galinier, Philippe |
2007 |
96-97 | Index 1 |
p. 312-326 15 p. |
artikel |
|
| 2967 | Solution to a conjecture on resistance diameter of lexicographic product of paths |
Sun, Wensheng |
|
96-97 | Index 1 |
p. 139-148 |
artikel |
|
| 2968 | Solution to a general version of a degree sequence variant of the Erdős–Sós conjecture |
Zeng, De-Yan |
|
96-97 | Index 1 |
p. 161-170 |
artikel |
|
| 2969 | Solution to a problem of Katona on counting cliques of weighted graphs |
Borg, Peter |
|
96-97 | Index 1 |
p. 147-155 |
artikel |
|
| 2970 | Solving Hamiltonian Cycle by an EPT algorithm for a non-sparse parameter |
Sæther, Sigve Hortemo |
2017 |
96-97 | Index 1 |
p. 88-97 10 p. |
artikel |
|
| 2971 | Solving makespan minimization problems with Lagrangean decomposition |
Guignard, Monique |
1993 |
96-97 | Index 1 |
p. 17-29 13 p. |
artikel |
|
| 2972 | Solving the Euclidean bottleneck biconnected edge subgraph problem by 2-relative neighborhood graphs |
Chang, M.S. |
1992 |
96-97 | Index 1 |
p. 1-12 12 p. |
artikel |
|
| 2973 | Solving the max-cut problem using eigenvalues |
Poljak, Svatopluk |
1995 |
96-97 | Index 1 |
p. 249-278 30 p. |
artikel |
|
| 2974 | Solving the maximum edge biclique packing problem on unbalanced bipartite graphs |
Acuña, V. |
2014 |
96-97 | Index 1 |
p. 2-12 11 p. |
artikel |
|
| 2975 | Some applications of graph theory to the study of polymer configuration |
Galina, Henryk |
1988 |
96-97 | Index 1 |
p. 167-176 10 p. |
artikel |
|
| 2976 | Some bounds on the largest eigenvalue of degree-based weighted adjacency matrix of a graph |
Gao, Jing |
|
96-97 | Index 1 |
p. 21-31 |
artikel |
|
| 2977 | Some bounds on the zero forcing number of a graph |
Gentner, Michael |
2018 |
96-97 | Index 1 |
p. 203-213 |
artikel |
|
| 2978 | Some completion problems for graphs without chordless cycles of prescribed lengths |
Busch, Arthur |
2019 |
96-97 | Index 1 |
p. 21-34 |
artikel |
|
| 2979 | Some extremal graphs with respect to inverse degree |
Xu, Kexiang |
2016 |
96-97 | Index 1 |
p. 171-183 13 p. |
artikel |
|
| 2980 | Some extremal problems on A α -spectral radius of graphs with given size |
Ye, Aiyun |
|
96-97 | Index 1 |
p. 286-294 |
artikel |
|
| 2981 | Some extremal properties of the degree distance of a graph |
Tomescu, Ioan |
1999 |
96-97 | Index 1 |
p. 159-163 5 p. |
artikel |
|
| 2982 | Some forbidden combinations of branches in minimal-ABC trees |
Dimitrov, Darko |
2018 |
96-97 | Index 1 |
p. 165-182 |
artikel |
|
| 2983 | Some general aspects of the framing number of a digraph |
Henning, Michael A. |
1998 |
96-97 | Index 1 |
p. 115-133 19 p. |
artikel |
|
| 2984 | Some graphs determined by their A α -spectra |
Chen, Yuanyuan |
|
96-97 | Index 1 |
p. 46-55 |
artikel |
|
| 2985 | Some local–global phenomena in locally finite graphs |
Asratian, Armen S. |
|
96-97 | Index 1 |
p. 166-176 |
artikel |
|
| 2986 | Some lower bounds for constant weight codes |
Honkala, Iiro |
1987 |
96-97 | Index 1 |
p. 95-98 4 p. |
artikel |
|
| 2987 | Some new bounds for the energy of graphs |
Dong, Jiuying |
|
96-97 | Index 1 |
p. 73-79 |
artikel |
|
| 2988 | Some new classes of facets for the equicut polytope |
de Souza, C.C. |
1995 |
96-97 | Index 1 |
p. 167-191 25 p. |
artikel |
|
| 2989 | Some new Z-cyclic whist tournaments |
Finizio, Norman J. |
2000 |
96-97 | Index 1 |
p. 115-130 16 p. |
artikel |
|
| 2990 | Some NP-complete problems for hypergraph degree sequences |
Colbourn, Charles J. |
1986 |
96-97 | Index 1 |
p. 239-254 16 p. |
artikel |
|
| 2991 | Some polynomially solvable subcases of the detailed routing problem in VLSI design |
Recski, András |
2001 |
96-97 | Index 1 |
p. 199-208 10 p. |
artikel |
|
| 2992 | Some problems on induced subgraphs |
Sivaraman, Vaidy |
2018 |
96-97 | Index 1 |
p. 422-427 |
artikel |
|
| 2993 | Some properties and applications of odd-colorable r -hypergraphs |
Yuan, Xiying |
2018 |
96-97 | Index 1 |
p. 446-452 |
artikel |
|
| 2994 | Some properties for a class of interchange graphs |
Jin, Jingjing |
2011 |
96-97 | Index 1 |
p. 2069-2077 9 p. |
artikel |
|
| 2995 | Some recent results on niche graphs |
Bowser, Stephen |
1991 |
96-97 | Index 1 |
p. 101-108 8 p. |
artikel |
|
| 2996 | Some results about the inset edge and average distance of trees |
Khalifeh, M.H. |
|
96-97 | Index 1 |
p. 186-199 |
artikel |
|
| 2997 | Some results about the interval number of a graph |
Maas, Christoph |
1983 |
96-97 | Index 1 |
p. 99-102 4 p. |
artikel |
|
| 2998 | Some results on chemical energy of graphs |
Zhang, Jianbin |
2014 |
96-97 | Index 1 |
p. 94-103 10 p. |
artikel |
|
| 2999 | Some results on { K 2 , C 2 i + 1 : i ≥ 1 } -factor in a graph |
Lv, Xiaoyun |
|
96-97 | Index 1 |
p. 81-92 |
artikel |
|
| 3000 | Some results on k -critical P 5 -free graphs |
Cai, Qingqiong |
|
96-97 | Index 1 |
p. 91-100 |
artikel |
3648 gevonden resultaten
| << vorige | volgende >> |