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

     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             47 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A functional completeness theorem for De Morgan functions Movsisyan, Yu.M.
 2014
 162 C p. 1-16
16 p.
 artikel
2 A generalization of an independent set with application to ( K q ; k ) -stable graphs Żak, Andrzej
 2014
 162 C p. 421-427
7 p.
 artikel
3 Algorithms for unipolar and generalized split graphs Eschen, Elaine M.
 2014
 162 C p. 195-201
7 p.
 artikel
4 A new sufficient condition for pancyclability of graphs Cai, Junqing
 2014
 162 C p. 142-148
7 p.
 artikel
5 An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph Zhang, Lianzhu
 2014
 162 C p. 348-354
7 p.
 artikel
6 A random model of publication activity Backhausz, Ágnes
 2014
 162 C p. 78-89
12 p.
 artikel
7 Automated generation of conjectures on forbidden subgraph characterization Desrosiers, Christian
 2014
 162 C p. 177-194
18 p.
 artikel
8 Binary linear programming solutions and non-approximability for control problems in voting systems Gurski, Frank
 2014
 162 C p. 391-398
8 p.
 artikel
9 Characterization of facets of the hop constrained chain polytope via dynamic programming Grötschel, Martin
 2014
 162 C p. 229-246
18 p.
 artikel
10 Computing HOMFLY polynomials of 2-bridge links from 4-plat representation Murakami, Masahiko
 2014
 162 C p. 271-284
14 p.
 artikel
11 Contents 2014
 162 C p. v-vii
nvt p.
 artikel
12 Cooperative assignment games with the inverse Monge property Martínez-de-Albéniz, F. Javier
 2014
 162 C p. 42-50
9 p.
 artikel
13 Deterministic walks with choice Beeler, Katy E.
 2014
 162 C p. 100-107
8 p.
 artikel
14 Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs Yan, Zhidan
 2014
 162 C p. 328-333
6 p.
 artikel
15 Extremal graphs for the geometric–arithmetic index with given minimum degree Divnić, Tomica
 2014
 162 C p. 386-390
5 p.
 artikel
16 ( F , I ) -security in graphs Petrie, Caleb
 2014
 162 C p. 285-295
11 p.
 artikel
17 Graph partition into small cliques Yan, Jin
 2014
 162 C p. 322-327
6 p.
 artikel
18 Hardness of learning loops, monoids, and semirings Chang, Ching-Lueh
 2014
 162 C p. 149-158
10 p.
 artikel
19 Independent domination in subcubic bipartite graphs of girth at least six Henning, Michael A.
 2014
 162 C p. 399-403
5 p.
 artikel
20 Lower bounds for treewidth of product graphs Kozawa, Kyohei
 2014
 162 C p. 251-258
8 p.
 artikel
21 Minimum degree, independence number and pseudo [ 2 , b ] -factors in graphs Bekkai, Siham
 2014
 162 C p. 108-114
7 p.
 artikel
22 More on the one-dimensional sliding-coin puzzle Lin, Ting-Yu
 2014
 162 C p. 32-41
10 p.
 artikel
23 New classes of clustering coefficient locally maximizing graphs Fukami, Tatsuya
 2014
 162 C p. 202-213
12 p.
 artikel
24 Nordhaus–Gaddum-type relations of three graph coloring parameters Huang, Kuo-Ching
 2014
 162 C p. 404-408
5 p.
 artikel
25 Novshek’s trick as a polynomial algorithm Kukushkin, Nikolai S.
 2014
 162 C p. 28-31
4 p.
 artikel
26 On an extremal hypergraph problem related to combinatorial batch codes Balachandran, Niranjan
 2014
 162 C p. 373-380
8 p.
 artikel
27 On ( 3 , 1 ) ∗ -choosability of planar graphs without adjacent short cycles Chen, Min
 2014
 162 C p. 159-166
8 p.
 artikel
28 On implicational bases of closure systems with unique critical sets Adaricheva, K.
 2014
 162 C p. 51-69
19 p.
 artikel
29 On the connectivity and restricted edge-connectivity of 3-arc graphs Balbuena, C.
 2014
 162 C p. 90-99
10 p.
 artikel
30 On the excessive [ m ] -index of a tree Mazzuoccolo, G.
 2014
 162 C p. 264-270
7 p.
 artikel
31 On the global forcing number of hexagonal systems Zhang, Heping
 2014
 162 C p. 334-347
14 p.
 artikel
32 On the immunity of rotation symmetric Boolean functions against fast algebraic attacks Zhang, Yin
 2014
 162 C p. 17-27
11 p.
 artikel
33 On the integer max-linear programming problem Butkovič, Peter
 2014
 162 C p. 128-141
14 p.
 artikel
34 On the intersection of all critical sets of a unicyclic graph Levit, Vadim E.
 2014
 162 C p. 409-414
6 p.
 artikel
35 On the structure of arbitrarily partitionable graphs with given connectivity Baudon, Olivier
 2014
 162 C p. 381-385
5 p.
 artikel
36 On the subgraph epimorphism problem Gay, Steven
 2014
 162 C p. 214-228
15 p.
 artikel
37 Optimal ordering of independent tests with precedence constraints Berend, D.
 2014
 162 C p. 115-127
13 p.
 artikel
38 Perfect domination sets in Cayley graphs Kwon, Young Soo
 2014
 162 C p. 259-263
5 p.
 artikel
39 Recognizing vertex intersection graphs of paths on bounded degree trees Alcón, L.
 2014
 162 C p. 70-77
8 p.
 artikel
40 Rotational circulant graphs Thomson, Alison
 2014
 162 C p. 296-305
10 p.
 artikel
41 Shortest paths in Sierpiński graphs Xue, Bing
 2014
 162 C p. 314-321
8 p.
 artikel
42 Spanning trails in essentially 4-edge-connected graphs Xu, Jinquan
 2014
 162 C p. 306-313
8 p.
 artikel
43 Sufficient sparseness conditions for G 2 to be ( Δ + 1 ) -choosable, when Δ ≥ 5 Cranston, Daniel W.
 2014
 162 C p. 167-176
10 p.
 artikel
44 The L ( p , q ) -labelling of planar graphs without 4-cycles Zhu, Haiyang
 2014
 162 C p. 355-363
9 p.
 artikel
45 The matching energy of graphs with given parameters Li, Shuli
 2014
 162 C p. 415-420
6 p.
 artikel
46 Tricyclic graph with maximal Estrada index Zhu, Zhongxun
 2014
 162 C p. 364-372
9 p.
 artikel
47 Wiener index of Eulerian graphs Gutman, Ivan
 2014
 162 C p. 247-250
4 p.
 artikel
                             47 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland