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
 
                             135 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 Abstract root systems and intervals in weak Bruhat order Samuel, Matthew J.
 2011
 38 C p. 481-486
6 p.
 artikel
2 A Characterization of König–Egerváry Graphs Using a Common Property of All Maximum Matchings Levit, Vadim E.
 2011
 38 C p. 565-570
6 p.
 artikel
3 A density Corrádi-Hajnal theorem Allen, Peter
 2011
 38 C p. 31-36
6 p.
 artikel
4 Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five Hocquard, Hervé
 2011
 38 C p. 457-462
6 p.
 artikel
5 A Doubly Exponentially Crumbled Cake Christ, Tobias
 2011
 38 C p. 265-271
7 p.
 artikel
6 A graph-theoretical axiomatization of oriented matroids Knauer, Kolja
 2011
 38 C p. 523-528
6 p.
 artikel
7 Algorithmic approaches for the minimum rainbow subgraph problem Koch, Maria
 2011
 38 C p. 765-770
6 p.
 artikel
8 All Graphs Have Antimagic Total Labelings Miller, Mirka
 2011
 38 C p. 645-650
6 p.
 artikel
9 Almost every tree with n edges decomposes K 2 n , 2 n Lladó, Anna
 2011
 38 C p. 571-574
4 p.
 artikel
10 A min-max theorem for LIFO-search Giannopoulou, Archontia C.
 2011
 38 C p. 395-400
6 p.
 artikel
11 An upper bound on the size of separated matchings Mészáros, Viola
 2011
 38 C p. 633-638
6 p.
 artikel
12 A proof of Sumnerʼs universal tournament conjecture for large tournaments Osthus, Deryk
 2011
 38 C p. 687-692
6 p.
 artikel
13 A proof of the dense version of Lovász conjecture Christofides, Demetres
 2011
 38 C p. 285-290
6 p.
 artikel
14 A Randomized Version of Ramseyʼs Theorem Gugelmann, Luca
 2011
 38 C p. 431-436
6 p.
 artikel
15 Asymptotically Optimal Randomized Rumor Spreading Doerr, Benjamin
 2011
 38 C p. 297-302
6 p.
 artikel
16 Asymptotically settling Zarankiewiczʼs Conjecture in finite time, for each m Christian, Robin
 2011
 38 C p. 279-284
6 p.
 artikel
17 Bounds and complexity results for strong edge colouring of subcubic graphs Hocquard, Hervé
 2011
 38 C p. 463-468
6 p.
 artikel
18 Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs Katona, Gyula Y.
 2011
 38 C p. 487-492
6 p.
 artikel
19 Chip-Firing and Riemann-Roch Theory for Directed Graphs Asadi, Arash
 2011
 38 C p. 63-68
6 p.
 artikel
20 Combinatorial batch codes: Extremal problems under Hall-type conditions Bujtás, Csilla
 2011
 38 C p. 201-206
6 p.
 artikel
21 Complete Intersection Problems for Finite Permutations Blinovsky, Vladimir
 2011
 38 C p. 147-148
2 p.
 artikel
22 Computing the clique number of a-perfect graphs in polynomial time Pêcher, Arnaud
 2011
 38 C p. 705-710
6 p.
 artikel
23 Contractors for flows Garijo, Delia
 2011
 38 C p. 389-394
6 p.
 artikel
24 Counting disk graphs McDiarmid, Colin
 2011
 38 C p. 627-632
6 p.
 artikel
25 Counting large distances in convex polygons: a computational approach Morić, Filip
 2011
 38 C p. 731-736
6 p.
 artikel
26 Counting lattice paths via a cycle lemma Nakamigawa, Tomoki
 2011
 38 C p. 675-680
6 p.
 artikel
27 Decomposing infinite matroids into their 3-connected minors Aigner-Horev, Elad
 2011
 38 C p. 11-16
6 p.
 artikel
28 Determining the flow numbers of signed eulerian graphs Máčajová, Edita
 2011
 38 C p. 585-590
6 p.
 artikel
29 Diagonal forms for incidence matrices and zero-sum Ramsey theory Wilson, Richard M.
 2011
 38 C p. 825-828
4 p.
 artikel
30 Digitalizing line segments Christ, Tobias
 2011
 38 C p. 273-278
6 p.
 artikel
31 Dimension and Height for Posets with Planar Cover Graphs Streib, Noah
 2011
 38 C p. 807-812
6 p.
 artikel
32 2-dipath and oriented L(2, 1)-labelings of some families of oriented planar graphs Sen, Sagnik
 2011
 38 C p. 771-776
6 p.
 artikel
33 Discrepancy of Centered Arithmetic Progressions in Z p (Extended Abstract) Hebbinghaus, Nils
 2011
 38 C p. 449-456
8 p.
 artikel
34 2-distance coloring of sparse graphs Bonamy, Marthe
 2011
 38 C p. 155-160
6 p.
 artikel
35 Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number Hoppen, C.
 2011
 38 C p. 469-474
6 p.
 artikel
36 Edge-distance-regular graphs Cámara, M.
 2011
 38 C p. 221-226
6 p.
 artikel
37 Edge identifying codes Foucaud, Florent
 2011
 38 C p. 343-348
6 p.
 artikel
38 Enumeration of RNA Hairpins and Cloverleaves Chang, Hsun-Wen
 2011
 38 C p. 245-250
6 p.
 artikel
39 Every hereditary permutation property is testable Bastos, Antônio J.O.
 2011
 38 C p. 123-128
6 p.
 artikel
40 Expected Crossing Numbers Mohar, Bojan
 2011
 38 C p. 651-656
6 p.
 artikel
41 Explosive Percolation in Erdős-Rényi-Like Random Graph Processes Panagiotou, Konstantinos
 2011
 38 C p. 699-704
6 p.
 artikel
42 Extremal Graphs without Cycles of Length 8 or Less Marshall, Kim
 2011
 38 C p. 615-620
6 p.
 artikel
43 2-factors in claw-free graphs Čada, Roman
 2011
 38 C p. 213-219
7 p.
 artikel
44 Families of Very Different Paths Körner, János
 2011
 38 C p. 529-533
5 p.
 artikel
45 Fast embedding of spanning trees in biased Maker-Breaker games Hefetz, Dan
 2011
 38 C p. 331-336
6 p.
 artikel
46 Feasibility Conditions on the Parameters of a Strongly Regular Graph Moço Mano, Vasco
 2011
 38 C p. 607-613
7 p.
 artikel
47 Forbidden Configurations: Boundary Cases Anstee, R.P.
 2011
 38 C p. 43-48
6 p.
 artikel
48 Forbidden structures for efficient First-Fit chain partitioning (extended abstract) Bosek, Bartłomiej
 2011
 38 C p. 173-179
7 p.
 artikel
49 Hamilton cycles in 4-connected troidal triangulations Kawarabayashi, Ken-ichi
 2011
 38 C p. 493-498
6 p.
 artikel
50 High connectivity keeping connected subgraph Fujita, Shinya
 2011
 38 C p. 355-360
6 p.
 artikel
51 Induced C 5-free graphs of fixed density: counting and homogeneous sets Böttcher, Julia
 2011
 38 C p. 181-186
6 p.
 artikel
52 Intersection of Longest Paths in a Graph de Rezende, Susanna F.
 2011
 38 C p. 743-748
6 p.
 artikel
53 Large B d -free and union-free subfamilies Barát, János
 2011
 38 C p. 101-104
4 p.
 artikel
54 Largest sparse subgraphs of random graphs Fountoulakis, Nikolaos
 2011
 38 C p. 349-354
6 p.
 artikel
55 Lift Contractions Golovach, Petr A.
 2011
 38 C p. 407-412
6 p.
 artikel
56 Linear extension diameter of subposets of Boolean lattice induced by two levels Fink, Jiří
 2011
 38 C p. 337-342
6 p.
 artikel
57 Linear number of diagonal flips in triangulations on surfaces Mori, Ryuichi
 2011
 38 C p. 669-674
6 p.
 artikel
58 Linear paths and trees in uniform hypergraphs Füredi, Zoltán
 2011
 38 C p. 377-382
6 p.
 artikel
59 Lower Bounds on the Odds Against Tree Spectral Sets Levit, Vadim E.
 2011
 38 C p. 559-564
6 p.
 artikel
60 Matchings in 3-uniform hypergraphs of large minimum vertex degree Treglown, Andrew
 2011
 38 C p. 813-818
6 p.
 artikel
61 Maximum genus of regular graphs Kotrbčík, M.
 2011
 38 C p. 535-540
6 p.
 artikel
62 Minimal families in terms of double-sided shadow in the Boolean cube layer Bashov, Maksim
 2011
 38 C p. 117-122
6 p.
 artikel
63 Minimizing the weight of the union-closure of uniform families of sets Leck, Uwe
 2011
 38 C p. 553-558
6 p.
 artikel
64 Minimum C k -saturated graphs Füredi, Zoltán
 2011
 38 C p. 505-510
6 p.
 artikel
65 Minimum d-Transversals of Maximum-Weight Stable Sets in Trees Bentz, Cédric
 2011
 38 C p. 129-134
6 p.
 artikel
66 Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs Buß, Enno
 2011
 38 C p. 207-212
6 p.
 artikel
67 Minmax degree of graphs (Extended abstract) Charpentier, Clément
 2011
 38 C p. 251-257
7 p.
 artikel
68 Minor-minimal non-projective planar graphs with an internal 3-separation Asadi, Arash
 2011
 38 C p. 69-75
7 p.
 artikel
69 Monochromatic components in edge-colored complete uniform hypergraphs Király, Zoltán
 2011
 38 C p. 517-521
5 p.
 artikel
70 New approach to Petersen coloring Šámal, Robert
 2011
 38 C p. 755-760
6 p.
 artikel
71 New results on connectivity of cages Salas, Julian
 2011
 38 C p. 93-99
7 p.
 artikel
72 Note on forcing pairs Hàn, Hiệp
 2011
 38 C p. 437-442
6 p.
 artikel
73 Obstructions to Injective Oriented Colourings MacGillivray, Gary
 2011
 38 C p. 597-605
9 p.
 artikel
74 Octants are Cover Decomposable Keszegh, Balázs
 2011
 38 C p. 499-504
6 p.
 artikel
75 On a Conjecture of Frankl and Füredi Chowdhury, Ameera
 2011
 38 C p. 259-263
5 p.
 artikel
76 On Balanced Coloring Games in Random Graphs Gugelmann, Luca
 2011
 38 C p. 425-430
6 p.
 artikel
77 On characterizations by nice forbidding sets Cerioli, Márcia R.
 2011
 38 C p. 233-238
6 p.
 artikel
78 On circulant thin Lehman matrices Sakuma, Tadashi
 2011
 38 C p. 783-788
6 p.
 artikel
79 On colorings of non-uniform hypergraphs without short cycles Rozovskaya, A.P.
 2011
 38 C p. 749-754
6 p.
 artikel
80 On disjoint crossing families in geometric graphs Fulek, Radoslav
 2011
 38 C p. 367-375
9 p.
 artikel
81 On Extremal Hypergraphs for Hamiltonian Cycles Glebov, Roman
 2011
 38 C p. 401-406
6 p.
 artikel
82 On Extremal k-CNF Formulas Amano, Kazuyuki
 2011
 38 C p. 37-42
6 p.
 artikel
83 On homometric sets in graphs Axenovich, Maria
 2011
 38 C p. 83-86
4 p.
 artikel
84 On induced acyclic subgraphs in sparse random digraphs Dutta, Kunal
 2011
 38 C p. 319-324
6 p.
 artikel
85 On symmetric quadrangulations Albenque, Marie
 2011
 38 C p. 17-24
8 p.
 artikel
86 On the Carathéodory Number for the Convexity of Paths of Order Three Barbosa, Rommel M.
 2011
 38 C p. 105-110
6 p.
 artikel
87 On the diameter of reconfiguration graphs for vertex colourings Bonamy, Marthe
 2011
 38 C p. 161-166
6 p.
 artikel
88 On the Erdos-Szekeres n-interior point problem Subramanya Bharadwaj, B.V.
 2011
 38 C p. 135-140
6 p.
 artikel
89 On the Fiedler value of large planar graphs (Extended abstract) Barrière, Lali
 2011
 38 C p. 111-116
6 p.
 artikel
90 On the flow numbers of signed complete and complete bipartite graphs Máčajová, Edita
 2011
 38 C p. 591-596
6 p.
 artikel
91 On the hull number of some graph classes Araujo, J.
 2011
 38 C p. 49-55
7 p.
 artikel
92 On the Limitations of Graph Invariants Inspired by Quantum Walks Smith, Jamie
 2011
 38 C p. 795-801
7 p.
 artikel
93 On the Moore-Penrose inverse of distance–regular graphs Carmona, Á.
 2011
 38 C p. 227-232
6 p.
 artikel
94 On the number of monochromatic solutions of integer linear systems on Abelian groups Serra, Oriol
 2011
 38 C p. 777-781
5 p.
 artikel
95 On the path-avoidance vertex-coloring game Mütze, Torsten
 2011
 38 C p. 657-662
6 p.
 artikel
96 On the queue-number of the hypercube Gregor, Petr
 2011
 38 C p. 413-418
6 p.
 artikel
97 On Tverbergʼs theorem Strausz, Ricardo
 2011
 38 C p. 803-805
3 p.
 artikel
98 On two-part Sperner systems for regular posets (Extended Abstract) Aydinian, Harout
 2011
 38 C p. 87-92
6 p.
 artikel
99 Ordinarization of Numerical Semigroups Bras-Amorós, Maria
 2011
 38 C p. 187-193
7 p.
 artikel
100 Outerplanar Obstructions for Matroid Pathwidth Koutsonas, Athanassios
 2011
 38 C p. 541-546
6 p.
 artikel
101 Packing k-partite k-uniform hypergraphs Mycroft, Richard
 2011
 38 C p. 663-668
6 p.
 artikel
102 Partitioning Chordal Graphs Feder, Tomás
 2011
 38 C p. 325-330
6 p.
 artikel
103 Partitioning 3-coloured complete graphs into three monochromatic paths Pokrovskiy, Alexey
 2011
 38 C p. 717-722
6 p.
 artikel
104 Perfect hypercubes Iványi, Antal
 2011
 38 C p. 475-480
6 p.
 artikel
105 Permutation Capacities and Oriented Infinite Paths Brightwell, Graham
 2011
 38 C p. 195-199
5 p.
 artikel
106 Permutations with few internal points Disanto, Filippo
 2011
 38 C p. 291-296
6 p.
 artikel
107 Polyhedral graph abstractions and an approach to the Linear Hirsch Conjecture Kim, Edward D.
 2011
 38 C p. 511-516
6 p.
 artikel
108 Preface Nešetřil, Jarik
 2011
 38 C p. 1-3
3 p.
 artikel
109 Programming in PYTHON and an algorithmic description of positive wandering on one-peak posets Gąsiorek, Marcin
 2011
 38 C p. 419-424
6 p.
 artikel
110 Proper Hamiltonian Paths in Edge-Colored Multigraphs Águeda, Raquel
 2011
 38 C p. 5-10
6 p.
 artikel
111 Rainbow Connection Number and Connected Dominating Sets Chandran, L. Sunil
 2011
 38 C p. 239-244
6 p.
 artikel
112 Rainbow k-connection in Dense Graphs (Extended Abstract) Fujita, Shinya
 2011
 38 C p. 361-366
6 p.
 artikel
113 Rainbow Matchings: existence and counting Perarnau, Guillem
 2011
 38 C p. 711-716
6 p.
 artikel
114 Rank-width and Well-quasi-ordering of Skew-Symmetric or Symmetric Matrices (extended abstract) Oum, Sang-il
 2011
 38 C p. 693-698
6 p.
 artikel
115 Reverse-free codes and permutations Füredi, Zoltán
 2011
 38 C p. 383-387
5 p.
 artikel
116 Social Networks Spread Rumors in Sublogarithmic Time Doerr, Benjamin
 2011
 38 C p. 303-308
6 p.
 artikel
117 Spectra and structure of weighted graphs Bolla, Marianna
 2011
 38 C p. 149-154
6 p.
 artikel
118 Square Roots of Minor Closed Graph Classes Nestoridis, Nestor V.
 2011
 38 C p. 681-686
6 p.
 artikel
119 Symbolic and numerical computation in determining P-critical unit forms and Tits P-critical posets Polak, Agnieszka
 2011
 38 C p. 723-730
8 p.
 artikel
120 Symmetry Breaking in Tournaments Lozano, Antoni
 2011
 38 C p. 579-584
6 p.
 artikel
121 The Growth Rate of High-Dimensional Tree Polycubes Aleksandrowicz, Gadi
 2011
 38 C p. 25-30
6 p.
 artikel
122 The Kirchhoff Index of Cluster Networks Araúz, C.
 2011
 38 C p. 57-62
6 p.
 artikel
123 The maximum sum and product of sizes of cross-intersecting families Borg, Peter
 2011
 38 C p. 167-172
6 p.
 artikel
124 There is a unique crossing-minimal rectilinear drawing of K 18 Aichholzer, Oswin
 2011
 38 C p. 547-552
6 p.
 artikel
125 The Tutte polynomial characterizes simple outerplanar graphs Goodall, Andrew J.
 2011
 38 C p. 639-644
6 p.
 artikel
126 The Universal Edge Elimination Polynomial and the Dichromatic Polynomial Averbouch, I.
 2011
 38 C p. 77-82
6 p.
 artikel
127 Three coloring planar graphs without cycles of length from 4 to 6 or seven cycles with close triangles Whalen, Peter
 2011
 38 C p. 819-824
6 p.
 artikel
128 Towards finite homomorphism-homogeneous relational structures Hartman, David
 2011
 38 C p. 443-448
6 p.
 artikel
129 Transformations in hexangulations on the sphere Matsumoto, Naoki
 2011
 38 C p. 621-626
6 p.
 artikel
130 Turán numbers for K s,t -free graphs: topological obstructions and algebraic constructions Blagojević, Pavle
 2011
 38 C p. 141-145
5 p.
 artikel
131 Unit Interval Graphs Rautenbach, Dieter
 2011
 38 C p. 737-742
6 p.
 artikel
132 Universal exponents and tail estimates in the enumeration of planar maps Drmota, Michael
 2011
 38 C p. 309-317
9 p.
 artikel
133 Unruly codes with unruly distances raise (combinatorial) problems Longo, Giuseppe O.
 2011
 38 C p. 575-578
4 p.
 artikel
134 Upper bound for the number of perfect (n,3)-codes Sapozhenko, Alexander
 2011
 38 C p. 761-764
4 p.
 artikel
135 Vertex Structure of Master Corner Polyhedra Shlyk, V.A.
 2011
 38 C p. 789-794
6 p.
 artikel
                             135 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland