Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             166 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A characterization of planar partial cubes Peterin, Iztok
2008
24 p. 6596-6600
5 p.
artikel
2 A characterization of subshifts with bounded powers Kellendonk, J.
2013
24 p. 2881-2894
14 p.
artikel
3 A combinatorial interpretation of the p , q -hit numbers Briggs, Karen S.
2008
24 p. 6078-6103
26 p.
artikel
4 A combinatorial proof of the Rayleigh formula for graphs Choe, YoungBin
2008
24 p. 5944-5953
10 p.
artikel
5 A counterexample to a conjecture of Grünbaum on piercing convex sets in the plane Müller, Tobias
2013
24 p. 2868-2871
4 p.
artikel
6 Acyclic 5-choosability of planar graphs without 4-cycles Chen, Min
2008
24 p. 6216-6225
10 p.
artikel
7 Acyclic edge coloring of sparse graphs Wang, Yingqian
2012
24 p. 3561-3573
13 p.
artikel
8 Acyclic edge coloring of subcubic graphs Basavaraju, Manu
2008
24 p. 6650-6653
4 p.
artikel
9 A Dirac-type characterization of k -chordal graphs Krithika, R.
2013
24 p. 2865-2867
3 p.
artikel
10 A finite goal set in the plane which is not a winner Pegden, Wesley
2008
24 p. 6546-6551
6 p.
artikel
11 An abundance of invariant polynomials satisfying the Riemann hypothesis Chinen, Koji
2008
24 p. 6426-6440
15 p.
artikel
12 A new class of antimagic Cartesian product graphs Cheng, Yongxi
2008
24 p. 6441-6448
8 p.
artikel
13 A new class of Ramsey–Turán problems Li, H.
2010
24 p. 3579-3583
5 p.
artikel
14 An extension of regular supermagic graphs Bezegová, L’udmila
2010
24 p. 3571-3578
8 p.
artikel
15 A note on a conjecture on maximum matching in almost regular graphs Picouleau, C.
2010
24 p. 3646-3647
2 p.
artikel
16 A note on Roman domination in graphs Xing, Hua-Ming
2006
24 p. 3338-3340
3 p.
artikel
17 A note on the adjacent vertex distinguishing total chromatic number of graphs Huang, Danjun
2012
24 p. 3544-3546
3 p.
artikel
18 A note on the edge cover chromatic index of multigraphs Xu, Changqing
2008
24 p. 6564-6568
5 p.
artikel
19 A refinement of Cusick–Cheon bound for the second order binary Reed–Muller code Cusick, Thomas W.
2010
24 p. 3537-3543
7 p.
artikel
20 A result on combinatorial curvature for embedded graphs on a surface Zhang, Lili
2008
24 p. 6588-6595
8 p.
artikel
21 Asymptotic connectivity of hyperbolic planar graphs Bahls, Patrick
2010
24 p. 3462-3472
11 p.
artikel
22 A technique to study the correlation measures of binary sequences Anantharam, Venkat
2008
24 p. 6203-6209
7 p.
artikel
23 Avoider–Enforcer games played on edge disjoint hypergraphs Ferber, Asaf
2013
24 p. 2932-2941
10 p.
artikel
24 Bipartite graphs are not universal fixers Gibson, R.G.
2008
24 p. 5937-5943
7 p.
artikel
25 Cayley graphs of order 30 p are Hamiltonian Ghaderpour, Ebrahim
2012
24 p. 3614-3625
12 p.
artikel
26 Chromatic uniqueness of a family of K 4 -homeomorphs Peng, Yan-ling
2008
24 p. 6132-6140
9 p.
artikel
27 Circulant tournaments of prime order are tight Llano, Bernardo
2008
24 p. 6056-6063
8 p.
artikel
28 Clique-width of graphs defined by one-vertex extensions Rao, Michaël
2008
24 p. 6157-6165
9 p.
artikel
29 Coloring the Cartesian sum of graphs Liu, Daphne Der-Fen
2008
24 p. 5928-5936
9 p.
artikel
30 Combinatorial constructions for maximum optical orthogonal signature pattern codes Pan, Rong
2013
24 p. 2918-2931
14 p.
artikel
31 Combinatorial properties of a general domination problem with parity constraints Hatzl, Johannes
2008
24 p. 6355-6367
13 p.
artikel
32 Combinatorial study of colored Hurwitz polyzêtas Enjalbert, Jean-Yves
2012
24 p. 3489-3497
9 p.
artikel
33 Combinatorial sums and finite differences Spivey, Michael Z.
2007
24 p. 3130-3146
17 p.
artikel
34 Composition of Post classes and normal forms of Boolean functions Couceiro, Miguel
2006
24 p. 3223-3243
21 p.
artikel
35 Concerning the shape of a geometric lattice Dukes, W.M.B.
2008
24 p. 6632-6638
7 p.
artikel
36 Constructing goal-minimally k -diametric graphs by lifts Gyürki, Štefan
2012
24 p. 3547-3552
6 p.
artikel
37 Construction of some countable 1-arc-transitive bipartite graphs Gray, Robert
2008
24 p. 6392-6405
14 p.
artikel
38 Contents 2006
24 p. vii-viii
nvt p.
artikel
39 Contractible subgraphs, Thomassen’s conjecture and the dominating cycle conjecture for snarks Broersma, Hajo
2008
24 p. 6064-6077
14 p.
artikel
40 Deciding nonconstructibility of 3-balls with spanning edges and interior vertices Kamei, Satoshi
2007
24 p. 3201-3206
6 p.
artikel
41 Degree sequence and supereulerian graphs Fan, Suohai
2008
24 p. 6626-6631
6 p.
artikel
42 Degree sum and nowhere-zero 3-flows Fan, Genghua
2008
24 p. 6233-6240
8 p.
artikel
43 Destroying automorphisms by fixing nodes Erwin, David
2006
24 p. 3244-3252
9 p.
artikel
44 Diameters of uniform subset graphs Chen, Yongzhu
2008
24 p. 6645-6649
5 p.
artikel
45 Distant irregularity strength of graphs Przybyło, Jakub
2013
24 p. 2875-2880
6 p.
artikel
46 Dominating and large induced trees in regular graphs Rautenbach, Dieter
2007
24 p. 3177-3186
10 p.
artikel
47 Edge-connectivity augmentation of graphs over symmetric parity families Szigeti, Zoltán
2008
24 p. 6527-6532
6 p.
artikel
48 Edge covered critical multigraphs Xu, Changqing
2008
24 p. 6348-6354
7 p.
artikel
49 Editorial board 2006
24 p. v-vi
nvt p.
artikel
50 Every 3-connected essentially 10-connected line graph is Hamilton-connected Li, Hao
2012
24 p. 3670-3674
5 p.
artikel
51 Extensions of barrier sets to nonzero roots of the matching polynomial Ku, Cheng Yeaw
2010
24 p. 3544-3550
7 p.
artikel
52 Extreme point axioms for closure spaces Ando, Kazutoshi
2006
24 p. 3181-3188
8 p.
artikel
53 Forbidden subgraphs and the existence of paths and cycles passing through specified vertices Fujisawa, Jun
2008
24 p. 6111-6114
4 p.
artikel
54 Forbidden subgraphs and the existence of spanning k -trees Ota, Katsuhiro
2010
24 p. 3506-3511
6 p.
artikel
55 Free quasi-symmetric functions and descent algebras for wreath products, and noncommutative multi-symmetric functions Novelli, Jean-Christophe
2010
24 p. 3584-3606
23 p.
artikel
56 Generalized Riordan arrays Wang, Weiping
2008
24 p. 6466-6500
35 p.
artikel
57 Generating 3-vertex connected spanning subgraphs Boros, Endre
2008
24 p. 6285-6297
13 p.
artikel
58 Graceful labellings of paths Cattell, Rohan
2007
24 p. 3161-3176
16 p.
artikel
59 Graham’s pebbling conjecture on products of many cycles Herscovici, David S.
2008
24 p. 6501-6512
12 p.
artikel
60 Graphic sequences with a realization containing a generalized friendship graph Yin, Jian-Hua
2008
24 p. 6226-6232
7 p.
artikel
61 Graph polynomials from principal pivoting Glantz, Roland
2006
24 p. 3253-3266
14 p.
artikel
62 Groupoids with quasigroup and Latin square properties Gałuszka, Jan
2008
24 p. 6414-6425
12 p.
artikel
63 Hadwiger’s Conjecture and inflations of the Petersen graph Pedersen, Anders Sune
2012
24 p. 3537-3543
7 p.
artikel
64 Hamilton cycles in digraphs of unitary matrices Gutin, G.
2006
24 p. 3315-3320
6 p.
artikel
65 Hamiltonian problem on claw-free and almost distance-hereditary graphs Feng, Jinfeng
2008
24 p. 6558-6563
6 p.
artikel
66 Hamiltonian properties of triangular grid graphs Gordon, Valery S.
2008
24 p. 6166-6188
23 p.
artikel
67 How many ways can two composition series intersect? Czédli, Gábor
2012
24 p. 3523-3536
14 p.
artikel
68 H -triangles with k interior H -points Wei, Xianglin
2008
24 p. 6015-6021
7 p.
artikel
69 Incidence coloring of the squares of some graphs Li, Deming
2008
24 p. 6569-6574
6 p.
artikel
70 Invalid proofs on incidence coloring Shiu, W.C.
2008
24 p. 6575-6580
6 p.
artikel
71 Iterative processes related to Riordan arrays: The reciprocation and the inversion of power series Luzón, Ana
2010
24 p. 3607-3618
12 p.
artikel
72 Kernels and some operations in edge-coloured digraphs Galeana-Sánchez, H.
2008
24 p. 6036-6046
11 p.
artikel
73 K 1 , 3 -factors in graphs Egawa, Yoshimi
2008
24 p. 5965-5973
9 p.
artikel
74 α -labeling number of trees Shiue, Chin-Lin
2006
24 p. 3290-3296
7 p.
artikel
75 Large sets of extended directed triple systems with odd orders Liu, Yuanyuan
2010
24 p. 3619-3632
14 p.
artikel
76 Latin bitrades derived from groups Cavenagh, Nicholas J.
2008
24 p. 6189-6202
14 p.
artikel
77 List-edge and list-total colorings of graphs embedded on hyperbolic surfaces Wu, Jianliang
2008
24 p. 6210-6215
6 p.
artikel
78 Local coloring of Kneser graphs Omoomi, Behnaz
2008
24 p. 5922-5927
6 p.
artikel
79 Local-edge-connectivity in digraphs and oriented graphs Volkmann, Lutz
2007
24 p. 3207-3212
6 p.
artikel
80 Long cycles in graphs without hamiltonian paths Kawarabayashi, Ken-ichi
2008
24 p. 5899-5906
8 p.
artikel
81 Lower bounding the boundary of a graph in terms of its maximum or minimum degree Müller, Tobias
2008
24 p. 6581-6583
3 p.
artikel
82 Lower bounds for the simplexity of the n -cube Glazyrin, Alexey
2012
24 p. 3656-3662
7 p.
artikel
83 Lower bounds on the minimum average distance of binary codes Mounits, Beniamin
2008
24 p. 6241-6253
13 p.
artikel
84 Matchings in graphs of odd regularity and girth Costa, Vitor
2013
24 p. 2895-2902
8 p.
artikel
85 Maximum order of trees and bipartite graphs with a given rank Ghorbani, E.
2012
24 p. 3498-3501
4 p.
artikel
86 Monomial complete intersections, the weak Lefschetz property and plane partitions Li, Jizhou
2010
24 p. 3558-3570
13 p.
artikel
87 More on pooling spaces Huang, Hau-wen
2008
24 p. 6330-6338
9 p.
artikel
88 Multipartite tournaments: A survey Volkmann, Lutz
2007
24 p. 3097-3129
33 p.
artikel
89 Multivariate linear recurrences and power series division Hauser, Herwig
2012
24 p. 3553-3560
8 p.
artikel
90 New polynomial-time algorithms for Camion bases Fukuda, Komei
2006
24 p. 3302-3306
5 p.
artikel
91 On a cycle partition problem Nielsen, Morten Hegner
2008
24 p. 6339-6347
9 p.
artikel
92 On arc-traceable local tournaments Meierling, Dirk
2008
24 p. 6513-6526
14 p.
artikel
93 On bipartite distance-regular graphs with a strongly closed subgraph of diameter three Kong, Qian
2010
24 p. 3523-3527
5 p.
artikel
94 On d -dimensional Buratti–Del Fra type dual hyperovals in P G ( 3 d , 2 ) Taniguchi, Hiroaki
2010
24 p. 3633-3645
13 p.
artikel
95 On degree sum conditions for long cycles and cycles through specified vertices Yamashita, Tomoki
2008
24 p. 6584-6587
4 p.
artikel
96 On distinct distances and λ -free point sets Dumitrescu, Adrian
2008
24 p. 6533-6538
6 p.
artikel
97 On hyperfocused arcs in PG ( 2 , q ) Giulietti, M.
2006
24 p. 3307-3314
8 p.
artikel
98 On isomorphisms of circulant digraphs of bounded degree Dobson, Edward
2008
24 p. 6047-6055
9 p.
artikel
99 On K s , t -minors in graphs with given average degree, II Kostochka, A.V.
2012
24 p. 3517-3522
6 p.
artikel
100 Online Ramsey games for triangles in random graphs Balogh, József
2010
24 p. 3653-3657
5 p.
artikel
101 On non-symmetric commutative association schemes with exactly one pair of non-symmetric relations Chia, G.L.
2006
24 p. 3189-3222
34 p.
artikel
102 On self-matching within integer part sequences Tognetti, Keith
2008
24 p. 6539-6545
7 p.
artikel
103 On STD k 3 [ k ; 3 ] ’s Akiyama, Kenzi
2008
24 p. 6449-6465
17 p.
artikel
104 On the combinatorics of Galois numbers Hitzemann, Steffen
2010
24 p. 3551-3557
7 p.
artikel
105 On the existence of 5-sun systems Fu, Chin-Mei
2013
24 p. 2942-2950
9 p.
artikel
106 On the existence of 3 -way k -homogeneous Latin trades Bagheri Gh., Behrooz
2012
24 p. 3473-3481
9 p.
artikel
107 On the Laplacian spectral radii of bicyclic graphs He, Chang-Xiang
2008
24 p. 5981-5995
15 p.
artikel
108 On the multiplicative monoid of n × n matrices over Z p m Cao, Yonglin
2007
24 p. 3081-3096
16 p.
artikel
109 On the number of hypercubic bipartitions of an integer Agnarsson, Geir
2013
24 p. 2857-2864
8 p.
artikel
110 On the spectral characterization of the union of complete multipartite graph and some isolated vertices Ma, Haicheng
2010
24 p. 3648-3652
5 p.
artikel
111 On the spectral radii of unicyclic graphs with fixed matching number Guo, Ji-Ming
2008
24 p. 6115-6131
17 p.
artikel
112 On the total detection numbers of complete bipartite graphs Escuadro, Henry
2013
24 p. 2908-2917
10 p.
artikel
113 Optimal and near-optimal mixed covering arrays by column expansion Sherwood, George B.
2008
24 p. 6022-6035
14 p.
artikel
114 Optimal broadcast domination in polynomial time Heggernes, Pinar
2006
24 p. 3267-3280
14 p.
artikel
115 Optimality conditions for Hunter’s bound Veneziani, Pierangela
2008
24 p. 6009-6014
6 p.
artikel
116 Packing 1×2×4 bricks in a cubical box Sharma, Prem L.
2008
24 p. 6003-6008
6 p.
artikel
117 Paired-domination number of a graph and its complement Favaron, O.
2008
24 p. 6601-6605
5 p.
artikel
118 Partitions of graphs into cographs Gimbel, John
2010
24 p. 3437-3445
9 p.
artikel
119 Path-comprehensive and vertex-pancyclic properties of super line graph L 2 ( G ) Li, Xia
2008
24 p. 6308-6315
8 p.
artikel
120 Path spectra for trees Chen, Guantao
2010
24 p. 3455-3461
7 p.
artikel
121 Perfect codes from the dual point of view I Heden, Olof
2008
24 p. 6141-6156
16 p.
artikel
122 Perfect matchings in pruned grid graphs Guichard, David R.
2008
24 p. 6552-6557
6 p.
artikel
123 Proof of two conjectures of Petkovšek and Wilf on Gessel walks Sun, Ping
2012
24 p. 3649-3655
7 p.
artikel
124 Quantum codes from caps Tonchev, Vladimir D.
2008
24 p. 6368-6372
5 p.
artikel
125 Quasigroups satisfying Stein’s third law with a specified number of idempotents Bennett, Frank E.
2012
24 p. 3585-3605
21 p.
artikel
126 Rainbowness of cubic plane graphs Jendrol’, Stanislav
2006
24 p. 3321-3326
6 p.
artikel
127 Raney and Catalan Jeurissen, R.H.
2008
24 p. 6298-6307
10 p.
artikel
128 Restricted matching in graphs of small genus Aldred, R.E.L.
2008
24 p. 5907-5921
15 p.
artikel
129 Roman dominating influence parameters Rubalcaba, Robert R.
2007
24 p. 3194-3200
7 p.
artikel
130 Semisymmetric elementary abelian covers of the Heawood graph Zhou, Jin-Xin
2010
24 p. 3658-3662
5 p.
artikel
131 Size-constrained graph partitioning polytopes Labbé, M.
2010
24 p. 3473-3493
21 p.
artikel
132 Some families of integral graphs Wang, Ligong
2008
24 p. 6383-6391
9 p.
artikel
133 Some new bounds for cover-free families through biclique covers Hajiabolhassan, Hossein
2012
24 p. 3626-3635
10 p.
artikel
134 Some results on Laplacian spectral radius of graphs with cut vertices Zhang, Xiaoling
2010
24 p. 3494-3505
12 p.
artikel
135 Some set partition statistics in non-crossing partitions and generating functions Yano, Fujine
2007
24 p. 3147-3160
14 p.
artikel
136 Spanning k -ended trees of bipartite graphs Kano, Mikio
2013
24 p. 2903-2907
5 p.
artikel
137 Sparse graphs of girth at least five are packable Görlich, Agnieszka
2012
24 p. 3606-3613
8 p.
artikel
138 Spectral radius of strongly connected digraphs Lin, Huiqiu
2012
24 p. 3663-3669
7 p.
artikel
139 Staircase tilings and k -Catalan structures Heubach, Silvia
2008
24 p. 5954-5964
11 p.
artikel
140 Strongly 4 -path-connectivity in almost regular multipartite tournaments Stella, Irene
2007
24 p. 3213-3219
7 p.
artikel
141 Tetravalent arc-transitive graphs of order twice a product of two primes Berčič, Katja
2012
24 p. 3643-3648
6 p.
artikel
142 The acircuitic directed star arboricity of subcubic graphs is at most four Pinlou, Alexandre
2006
24 p. 3281-3289
9 p.
artikel
143 The chromatic number of 5-valent circulants Meszka, Mariusz
2008
24 p. 6269-6284
16 p.
artikel
144 The circular chromatic index of Goldberg snarks Ghebleh, Mohammad
2007
24 p. 3220-3225
6 p.
artikel
145 The crossing number of K 1 , m , n Ho, Pak Tung
2008
24 p. 5996-6002
7 p.
artikel
146 The crossing number of K 2 , m □ P n Zheng, Wenping
2008
24 p. 6639-6644
6 p.
artikel
147 The fractional chromatic number of triangle-free graphs with Δ ≤ 3 Lu, Linyuan
2012
24 p. 3502-3516
15 p.
artikel
148 The hamiltonian index of a 2-connected graph Xiong, Liming
2008
24 p. 6373-6382
10 p.
artikel
149 The k -tuple twin domination in de Bruijn and Kautz digraphs Araki, Toru
2008
24 p. 6406-6413
8 p.
artikel
150 The last twenty orders of ( 1 , 2 ) -resolvable Steiner quadruple systems Meng, Zhaoping
2012
24 p. 3574-3584
11 p.
artikel
151 The number of vertices of degree 7 in a contraction-critical 7-connected graph Li, Min
2008
24 p. 6262-6268
7 p.
artikel
152 The radius of k -connected planar graphs with bounded faces Ali, Patrick
2012
24 p. 3636-3642
7 p.
artikel
153 The Ramsey numbers for disjoint unions of trees Baskoro, E.T.
2006
24 p. 3297-3301
5 p.
artikel
154 The Ramsey numbers of large cycles versus wheels Surahmat,
2006
24 p. 3334-3337
4 p.
artikel
155 There is no [ 21 , 5 , 14 ] code over F 5 Araya, Makoto
2013
24 p. 2872-2874
3 p.
artikel
156 The 6-relaxed game chromatic number of outerplanar graphs Wu, Jiaojiao
2008
24 p. 5974-5980
7 p.
artikel
157 The strong chromatic index of a class of graphs Wu, Jianzhuan
2008
24 p. 6254-6261
8 p.
artikel
158 The sum of the squares of degrees: Sharp asymptotics Nikiforov, Vladimir
2007
24 p. 3187-3193
7 p.
artikel
159 The weight hierarchies of q -ary linear codes of dimension 4 Hu, Guoxiang
2010
24 p. 3528-3536
9 p.
artikel
160 Total and fractional total colourings of circulant graphs Khennoufa, Riadh
2008
24 p. 6316-6329
14 p.
artikel
161 Total domination stable graphs upon edge addition Desormeaux, Wyatt J.
2010
24 p. 3446-3454
9 p.
artikel
162 Total edge critical graphs with leaves Hattingh, Johannes H.
2012
24 p. 3482-3488
7 p.
artikel
163 Two characterisations of minimal triangulations of 2 K 2 -free graphs Meister, Daniel
2006
24 p. 3327-3333
7 p.
artikel
164 Two types of switchable λ -fold ( K 4 − e ) -designs Chang, Yanxun
2008
24 p. 6606-6625
20 p.
artikel
165 Unavoidable topological minors of infinite graphs Chun, Carolyn
2010
24 p. 3512-3522
11 p.
artikel
166 Uniquely pairable graphs Che, Zhongyuan
2008
24 p. 6104-6110
7 p.
artikel
                             166 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland