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
 
                             82 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A characterization of λ d , 1 -minimal trees and other attainable classes Jonck, Elizabeth
2009
309 8 p. 2340-2348
9 p.
artikel
2 Achieving maximum chromatic index in multigraphs McDonald, J.M.
2009
309 8 p. 2077-2084
8 p.
artikel
3 A generalization of a conjecture due to Erdős, Jacobson and Lehel Yin, Jian-Hua
2009
309 8 p. 2579-2583
5 p.
artikel
4 A new proof of the septuple product identity Yan, Qinglun
2009
309 8 p. 2589-2591
3 p.
artikel
5 An oriented coloring of planar graphs with girth at least five Pinlou, Alexandre
2009
309 8 p. 2108-2118
11 p.
artikel
6 A note on convex subsets of Z k Hwang, Kyung-Won
2009
309 8 p. 2533-2534
2 p.
artikel
7 A note on dominating sets and average distance DeLaViña, Ermelinda
2009
309 8 p. 2615-2619
5 p.
artikel
8 A note on the Path Kernel Conjecture Katrenič, Peter
2009
309 8 p. 2551-2554
4 p.
artikel
9 An upper bound for Cubicity in terms of Boxicity Sunil Chandran, L.
2009
309 8 p. 2571-2574
4 p.
artikel
10 A short note on the overpartition function Kim, Byungchan
2009
309 8 p. 2528-2532
5 p.
artikel
11 Asymptotic connectivity of infinite graphs Bahls, Patrick
2009
309 8 p. 2250-2259
10 p.
artikel
12 Bipartite rainbow numbers of matchings Li, Xueliang
2009
309 8 p. 2575-2578
4 p.
artikel
13 Cayley graphs on left quasi-groups and groupoids representing k -generalised Petersen graphs Mwambene, Eric
2009
309 8 p. 2544-2547
4 p.
artikel
14 Characterizations for P ≥ 2 -factor and P ≥ 3 -factor covered graphs Zhang, Heping
2009
309 8 p. 2067-2076
10 p.
artikel
15 4-chromatic edge critical Grötzsch–Sachs graphs Dobrynin, A.A.
2009
309 8 p. 2564-2566
3 p.
artikel
16 Complete description of forbidden subgraphs in the structural domination problem Bacsó, Gábor
2009
309 8 p. 2466-2472
7 p.
artikel
17 Concise proofs for adjacent vertex-distinguishing total colorings Hulgan, Jonathan
2009
309 8 p. 2548-2550
3 p.
artikel
18 Connected domination of regular graphs Duckworth, W.
2009
309 8 p. 2305-2322
18 p.
artikel
19 Covering the vertices of a graph with cycles of bounded length Bekkai, Siham
2009
309 8 p. 1963-1966
4 p.
artikel
20 Cubicity, boxicity, and vertex cover Sunil Chandran, L.
2009
309 8 p. 2488-2496
9 p.
artikel
21 Cubicity of threshold graphs Adiga, Abhijin
2009
309 8 p. 2535-2537
3 p.
artikel
22 Degree condition for the existence of a k -factor containing a given Hamiltonian cycle Gao, Yunshu
2009
309 8 p. 2373-2381
9 p.
artikel
23 Deletion–contraction to form a polymatroid Chun, Deborah
2009
309 8 p. 2592-2595
4 p.
artikel
24 Dirac-type generalizations concerning large cycles in graphs Nikoghosyan, Zh.G.
2009
309 8 p. 1925-1930
6 p.
artikel
25 Directional complexity of the hypercubic billiard Bedaride, Nicolas
2009
309 8 p. 2053-2066
14 p.
artikel
26 Double vertex digraphs of digraphs Gao, Yubin
2009
309 8 p. 2432-2444
13 p.
artikel
27 Dual and self-dual negacyclic codes of even length over Z 2 a Zhu, Shixin
2009
309 8 p. 2382-2391
10 p.
artikel
28 Edge choosability of planar graphs without 5-cycles with a chord Chen, Yongzhu
2009
309 8 p. 2233-2238
6 p.
artikel
29 Edge-disjoint spanners in tori Liestman, Arthur L.
2009
309 8 p. 2239-2249
11 p.
artikel
30 Entire choosability of near-outerplane graphs Hetherington, Timothy J.
2009
309 8 p. 2153-2165
13 p.
artikel
31 Enumerating S n by associated transpositions and linear extensions of finite posets Conflitti, Alessandro
2009
309 8 p. 2020-2041
22 p.
artikel
32 Enumerating typical abelian prime-fold coverings of a circulant graph Feng, Rongquan
2009
309 8 p. 2174-2179
6 p.
artikel
33 Enumeration of bilaterally symmetric 3-noncrossing partitions Xin, Guoce
2009
309 8 p. 2497-2509
13 p.
artikel
34 Finding Hamiltonian cycles in { q u a s i - c l a w , K 1 , 5 , K 1 , 5 + e } -free graphs with bounded Dilworth numbers Li, Rao
2009
309 8 p. 2555-2558
4 p.
artikel
35 First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph Fan, Yi-Zheng
2009
309 8 p. 2479-2487
9 p.
artikel
36 Full rank perfect codes and α -kernels Heden, Olof
2009
309 8 p. 2202-2216
15 p.
artikel
37 Further results on ( v , { 5 , w ∗ } , 1 ) -PBDs Abel, R. Julian R.
2009
309 8 p. 2323-2339
17 p.
artikel
38 Globally bi- 3 ∗ -connected graphs Kao, Shin-Shin
2009
309 8 p. 1931-1946
16 p.
artikel
39 Graph pegging numbers Helleloid, Geir
2009
309 8 p. 1971-1985
15 p.
artikel
40 Greedily constructing maximal partial f -factors Tankus, David
2009
309 8 p. 2180-2189
10 p.
artikel
41 Hamilton cycles in circulant digraphs with prescribed number of distinct jumps Bogdanowicz, Zbigniew R.
2009
309 8 p. 2100-2107
8 p.
artikel
42 Hamilton cycles in claw-heavy graphs Chen, Bing
2009
309 8 p. 2015-2019
5 p.
artikel
43 Harmonic conjugation in harmonic matroids Flórez, Rigoberto
2009
309 8 p. 2365-2372
8 p.
artikel
44 Independence polynomials of circulants with an application to music Brown, Jason
2009
309 8 p. 2292-2304
13 p.
artikel
45 L ( h , k ) -labelings of Hamming graphs Huang, Lian-Hwao
2009
309 8 p. 2197-2201
5 p.
artikel
46 Lower bounds on the signed domination numbers of directed graphs Karami, H.
2009
309 8 p. 2567-2570
4 p.
artikel
47 Minimum broadcast tree decompositions Walsh, Matthew
2009
309 8 p. 2620-2625
6 p.
artikel
48 Minimum perimeter rectangles that enclose congruent non-overlapping circles Lubachevsky, Boris D.
2009
309 8 p. 1947-1962
16 p.
artikel
49 Netlike partial cubes III. The median cycle property Polat, Norbert
2009
309 8 p. 2119-2133
15 p.
artikel
50 Netlike partial cubes II. Retracts and netlike subgraphs Polat, Norbert
2009
309 8 p. 1986-1998
13 p.
artikel
51 Nordhaus–Gaddum inequalities for the fractional and circular chromatic numbers Brown, J.I.
2009
309 8 p. 2223-2232
10 p.
artikel
52 Number of walks and degree powers in a graph Fiol, M.A.
2009
309 8 p. 2613-2614
2 p.
artikel
53 On affine difference sets and their multipliers Hiramine, Yutaka
2009
309 8 p. 2148-2152
5 p.
artikel
54 On 3-choosable planar graphs of girth at least 4 Li, Xiangwen
2009
309 8 p. 2424-2431
8 p.
artikel
55 On circle graphs with girth at least five Esperet, Louis
2009
309 8 p. 2217-2222
6 p.
artikel
56 On coloured constant composition designs Greferath, Marcus
2009
309 8 p. 2410-2416
7 p.
artikel
57 On direct product cancellation of graphs Hammack, Richard H.
2009
309 8 p. 2538-2543
6 p.
artikel
58 On (0, 1)-matrices with prescribed row and column sum vectors da Fonseca, C.M.
2009
309 8 p. 2519-2527
9 p.
artikel
59 On symmetric digraphs of the congruence x k ≡ y ( mod n ) Somer, Lawrence
2009
309 8 p. 1999-2009
11 p.
artikel
60 On the classification of quartic half-arc-transitive metacirculants Šparl, Primož
2009
309 8 p. 2271-2283
13 p.
artikel
61 On the combinatorics of the Pfaff identity Chen, William Y.C.
2009
309 8 p. 2190-2196
7 p.
artikel
62 On the domination number of generalized Petersen graphs P ( n , 2 ) Fu, Xueliang
2009
309 8 p. 2445-2451
7 p.
artikel
63 On the number of cycles in local tournaments Meierling, Dirk
2009
309 8 p. 2042-2052
11 p.
artikel
64 On the ratios between packing and domination parameters of a graph Burger, Alewyn P.
2009
309 8 p. 2473-2478
6 p.
artikel
65 On the symmetry of Welch- and Golomb-constructed Costas arrays Drakakis, Konstantinos
2009
309 8 p. 2559-2563
5 p.
artikel
66 On zero-sum partitions and anti-magic trees Kaplan, Gil
2009
309 8 p. 2010-2014
5 p.
artikel
67 Parity and disparity subgraphs McKee, Terry A.
2009
309 8 p. 2608-2612
5 p.
artikel
68 Partial permutation decoding for the first-order Reed–Muller codes Seneviratne, P.
2009
309 8 p. 1967-1970
4 p.
artikel
69 Path transferability of graphs with bounded minimum degree Torii, Ryuzo
2009
309 8 p. 2392-2397
6 p.
artikel
70 Powerful alliances in graphs Brigham, Robert C.
2009
309 8 p. 2140-2147
8 p.
artikel
71 Results on rotation symmetric bent functions Dalai, Deepak K.
2009
309 8 p. 2398-2409
12 p.
artikel
72 Some results on ( a : b ) -choosability Gutner, Shai
2009
309 8 p. 2260-2270
11 p.
artikel
73 Sum choice numbers of some graphs Heinold, Brian
2009
309 8 p. 2166-2173
8 p.
artikel
74 The covolume of discrete subgroups of Iso ( H 2 m ) Zehrt, Thomas
2009
309 8 p. 2284-2291
8 p.
artikel
75 The exact domination number of the generalized Petersen graphs Yan, Hong
2009
309 8 p. 2596-2607
12 p.
artikel
76 The hull and geodetic numbers of orientations of graphs Hung, Jung-Ting
2009
309 8 p. 2134-2139
6 p.
artikel
77 The SAT–UNSAT transition for random constraint satisfaction problems Creignou, Nadia
2009
309 8 p. 2085-2099
15 p.
artikel
78 The structure of even factors in claw-free graphs Xiong, Liming
2009
309 8 p. 2417-2423
7 p.
artikel
79 Two kinds of hook length formulas for complete m -ary trees Sun, Yidong
2009
309 8 p. 2584-2588
5 p.
artikel
80 Uniformly resolvable designs with index one and block sizes three and four — with three or five parallel classes of block size four Schuster, Ernst
2009
309 8 p. 2452-2465
14 p.
artikel
81 What majority decisions are possible Shelah, Saharon
2009
309 8 p. 2349-2364
16 p.
artikel
82 Zero-divisor semigroups and refinements of a star graph Wu, Tongsuo
2009
309 8 p. 2510-2518
9 p.
artikel
                             82 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland