|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
112 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A classification of arc-locally semicomplete digraphs |
Galeana-Sánchez, H. |
2009 |
34 | C |
p. 59-61 3 p. |
artikel |
|
| 2 | Acyclic choosability of planar graphs: a Steinberg like approach |
Hocquard, Hervé |
2009 |
34 | C |
p. 199-205 7 p. |
artikel |
|
| 3 | Acyclic edge-colouring of planar graphs. Extended abstract |
Cohen, Nathann |
2009 |
34 | C |
p. 417-421 5 p. |
artikel |
|
| 4 | A Decomposition Theorem for Chordal Graphs and its Applications |
Habib, Michel |
2009 |
34 | C |
p. 561-565 5 p. |
artikel |
|
| 5 | A general critical condition for the emergence of a giant component in random graphs with given degrees |
Fountoulakis, Nikolaos |
2009 |
34 | C |
p. 639-645 7 p. |
artikel |
|
| 6 | A Linear Programming Construction of Fully Optimal Bases in Graphs and Hyperplane Arrangements |
Gioan, Emeric |
2009 |
34 | C |
p. 307-311 5 p. |
artikel |
|
| 7 | An expected polynomial time algorithm for coloring 2-colorable 3-graphs |
Person, Yury |
2009 |
34 | C |
p. 465-469 5 p. |
artikel |
|
| 8 | A note on some inequalities for the Tutte polynomial of a matroid |
Merino, Criel |
2009 |
34 | C |
p. 603-607 5 p. |
artikel |
|
| 9 | Antibandwidth and Cyclic Antibandwidth of Hamming Graphs |
Dobrev, Stefan |
2009 |
34 | C |
p. 295-300 6 p. |
artikel |
|
| 10 | A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading |
Doerr, Benjamin |
2009 |
34 | C |
p. 335-339 5 p. |
artikel |
|
| 11 | Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph |
Grappe, Roland |
2009 |
34 | C |
p. 173-177 5 p. |
artikel |
|
| 12 | Avoider-Enforcer: The Rules of the Game |
Hefetz, Dan |
2009 |
34 | C |
p. 261-265 5 p. |
artikel |
|
| 13 | Bijections on two variations of noncrossing partitions |
Kim, Jang Soo |
2009 |
34 | C |
p. 283-288 6 p. |
artikel |
|
| 14 | Bounds for the b-chromatic number of vertex-deleted subgraphs and the extremal graphs |
Raj, S. Francis |
2009 |
34 | C |
p. 353-358 6 p. |
artikel |
|
| 15 | Characterising claw-free t-perfect graphs |
Stein, Maya |
2009 |
34 | C |
p. 501-507 7 p. |
artikel |
|
| 16 | Chip-Firing, Antimatroids, and Polyhedra |
Knauer, Kolja |
2009 |
34 | C |
p. 9-13 5 p. |
artikel |
|
| 17 | Chromatic number of sparse colored mixed planar graphs |
Montejano, Amanda |
2009 |
34 | C |
p. 363-367 5 p. |
artikel |
|
| 18 | Circular edge-colorings of cubic graphs with girth six |
Král', Daniel |
2009 |
34 | C |
p. 525-529 5 p. |
artikel |
|
| 19 | Cliques in graphs with bounded minimum degree |
Lo, Allan |
2009 |
34 | C |
p. 163-166 4 p. |
artikel |
|
| 20 | Codings of rotations on two intervals are full |
Massé, A. Blondin |
2009 |
34 | C |
p. 289-293 5 p. |
artikel |
|
| 21 | Colored Pebble Motion on Graphs (Extended Abstract) |
Fujita, Shinya |
2009 |
34 | C |
p. 185-189 5 p. |
artikel |
|
| 22 | Coloring a set of touching strings |
Esperet, Louis |
2009 |
34 | C |
p. 213-217 5 p. |
artikel |
|
| 23 | Coloring Fuzzy Circular Interval Graphs |
Eisenbrand, Friedrich |
2009 |
34 | C |
p. 543-548 6 p. |
artikel |
|
| 24 | Coloring the edges of a random graph without a monochromatic giant component |
Spöhel, Reto |
2009 |
34 | C |
p. 615-619 5 p. |
artikel |
|
| 25 | Combinatorial properties of Catalan pairs |
Disanto, Filippo |
2009 |
34 | C |
p. 429-433 5 p. |
artikel |
|
| 26 | Counting flags in triangle-free digraphs |
Hladký, Jan |
2009 |
34 | C |
p. 621-625 5 p. |
artikel |
|
| 27 | Counting Homomorphisms to Sparse Graphs |
Nešetřil, Jaroslav |
2009 |
34 | C |
p. 393-397 5 p. |
artikel |
|
| 28 | Cubic bridgeless graphs have more than a linear number of perfect matchings |
Esperet, Louis |
2009 |
34 | C |
p. 411-415 5 p. |
artikel |
|
| 29 | Cubicity of Interval Graphs and the Claw Number |
Adiga, Abhijin |
2009 |
34 | C |
p. 471-475 5 p. |
artikel |
|
| 30 | Cycle codes of graphs and MDS array codes |
Serra, Oriol |
2009 |
34 | C |
p. 95-99 5 p. |
artikel |
|
| 31 | 4-cycles at the triangle-free process |
Wolfovitz, Guy |
2009 |
34 | C |
p. 589-592 4 p. |
artikel |
|
| 32 | d-collapsibility is NP-complete for d ⩾ 4 |
Tancer, Martin |
2009 |
34 | C |
p. 53-57 5 p. |
artikel |
|
| 33 | Defending Planar Graphs against Star-Cutsets |
Sonnerat, Nicolas |
2009 |
34 | C |
p. 107-111 5 p. |
artikel |
|
| 34 | Degree sequences forcing Hamilton cycles in directed graphs |
Kühn, Daniela |
2009 |
34 | C |
p. 347-351 5 p. |
artikel |
|
| 35 | Discrete Concavity and Zeros of Polynomials |
Brändén, Petter |
2009 |
34 | C |
p. 531-535 5 p. |
artikel |
|
| 36 | Disjoint Even Cycles Packing |
Chiba, Shuya |
2009 |
34 | C |
p. 113-119 7 p. |
artikel |
|
| 37 | Disjoint sub(di)graphs in digraphs |
Bang-Jensen, Jørgen |
2009 |
34 | C |
p. 179-183 5 p. |
artikel |
|
| 38 | ℓ-distant Hamiltonian walks in Cartesian product graphs |
Togni, Olivier |
2009 |
34 | C |
p. 69-73 5 p. |
artikel |
|
| 39 | Distributive Lattice Polyhedra |
Kempner, Yulia |
2009 |
34 | C |
p. 483-487 5 p. |
artikel |
|
| 40 | Ear decompositions of a cubic bridgeless graph and near P4-decompositions of its deck |
Häggkvist, Roland |
2009 |
34 | C |
p. 191-198 8 p. |
artikel |
|
| 41 | European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009) |
Nešetřil, Jaroslav |
2009 |
34 | C |
p. 1-8 8 p. |
artikel |
|
| 42 | Every rayless graph has an unfriendly partition |
Bruhn, Henning |
2009 |
34 | C |
p. 279-281 3 p. |
artikel |
|
| 43 | Extended Gallai's Theorem |
Nigussie, Yared |
2009 |
34 | C |
p. 399-403 5 p. |
artikel |
|
| 44 | Factorization and catenary degree in 3-generated numerical semigroups |
Aguiló-Gost, Francesc |
2009 |
34 | C |
p. 157-161 5 p. |
artikel |
|
| 45 | Flip Graphs of Bounded-Degree Triangulations |
Aichholzer, O. |
2009 |
34 | C |
p. 509-513 5 p. |
artikel |
|
| 46 | Forcing spanning subgraphs via Ore type conditions |
Böttcher, Julia |
2009 |
34 | C |
p. 255-259 5 p. |
artikel |
|
| 47 | Formulae and Growth Rates of High-Dimensional Polycubes |
Barequet, Ronnie |
2009 |
34 | C |
p. 459-463 5 p. |
artikel |
|
| 48 | Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time |
Kennedy, W. Sean |
2009 |
34 | C |
p. 47-51 5 p. |
artikel |
|
| 49 | Full Orientability of Graphs |
Tong, Li-Da |
2009 |
34 | C |
p. 669-672 4 p. |
artikel |
|
| 50 | Game chromatic number of toroidal grids |
Wu, Jiaojiao |
2009 |
34 | C |
p. 381-385 5 p. |
artikel |
|
| 51 | Graph homomorphisms, the Tutte polynomial and “q-state Potts uniqueness” |
Garijo, Delia |
2009 |
34 | C |
p. 231-236 6 p. |
artikel |
|
| 52 | Graphs of odd girth 7 with large degree |
Brandt, Stephan |
2009 |
34 | C |
p. 89-93 5 p. |
artikel |
|
| 53 | Hamilton cycles in 6-connected claw-free graphs (Extended abstract) |
Kaiser, Tomáš |
2009 |
34 | C |
p. 319-322 4 p. |
artikel |
|
| 54 | Hereditary quasi-random properties of hypergraphs |
Dellamonica Jr., Domingos |
2009 |
34 | C |
p. 495-499 5 p. |
artikel |
|
| 55 | Hypercube 1-factorizations from extended Hamming codes |
Gregor, Petr |
2009 |
34 | C |
p. 627-631 5 p. |
artikel |
|
| 56 | Hypergraphs with no odd cycle of given length |
Győri, Ervin |
2009 |
34 | C |
p. 359-362 4 p. |
artikel |
|
| 57 | Identifying Codes in Trees and Planar Graphs |
Auger, David |
2009 |
34 | C |
p. 585-588 4 p. |
artikel |
|
| 58 | Kneser Colorings of Uniform Hypergraphs |
Hoppen, C. |
2009 |
34 | C |
p. 219-223 5 p. |
artikel |
|
| 59 | Linear Extension Diameter of Downset Lattices of 2-Dimensional Posets |
Felsner, Stefan |
2009 |
34 | C |
p. 313-317 5 p. |
artikel |
|
| 60 | List colorings with distinct list sizes, the case of complete bipartite graphs |
Füredi, Zoltán |
2009 |
34 | C |
p. 323-327 5 p. |
artikel |
|
| 61 | Loebl-Komlós-Sós Conjecture: dense case |
Cooley, Oliver |
2009 |
34 | C |
p. 609-613 5 p. |
artikel |
|
| 62 | Long paths and cycles in faulty hypercubes: existence, optimality, complexity |
Dvořák, Tomáš |
2009 |
34 | C |
p. 35-39 5 p. |
artikel |
|
| 63 | Lower Bounds for Pinning Lines by Balls (Extended Abstract) |
Cheong, Otfried |
2009 |
34 | C |
p. 567-571 5 p. |
artikel |
|
| 64 | Maximum values of Szeged index and edge-Szeged index of graphs |
Chiniforooshan, Ehsan |
2009 |
34 | C |
p. 405-409 5 p. |
artikel |
|
| 65 | Minimizing the Oriented Diameter of a Planar Graph |
Eggemann, Nicole |
2009 |
34 | C |
p. 267-271 5 p. |
artikel |
|
| 66 | Minimum degree conditions for large subgraphs |
Allen, Peter |
2009 |
34 | C |
p. 75-79 5 p. |
artikel |
|
| 67 | Monochromatic geometric k-factors in red-blue sets with white and Steiner points |
Garijo, D. |
2009 |
34 | C |
p. 151-155 5 p. |
artikel |
|
| 68 | New results on planar and directed multicuts |
Bentz, Cédric |
2009 |
34 | C |
p. 207-211 5 p. |
artikel |
|
| 69 | Obstructions for Tree-depth |
Giannopoulou, Archontia C. |
2009 |
34 | C |
p. 249-253 5 p. |
artikel |
|
| 70 | On a Conjecture of Fan and Raspaud |
Máčajová, Edita |
2009 |
34 | C |
p. 237-241 5 p. |
artikel |
|
| 71 | On distance edge-colourings and matchings |
Kang, Ross |
2009 |
34 | C |
p. 301-306 6 p. |
artikel |
|
| 72 | On Erdős-Szekeres-type problems |
Koshelev, V.A. |
2009 |
34 | C |
p. 447-451 5 p. |
artikel |
|
| 73 | On even-cycle-free subgraphs of the hypercube |
Füredi, Zoltán |
2009 |
34 | C |
p. 515-517 3 p. |
artikel |
|
| 74 | On Extremal Graphs with Bounded Girth |
Delorme, Charles |
2009 |
34 | C |
p. 653-657 5 p. |
artikel |
|
| 75 | On t-Cliques in k-Walk-Regular Graphs |
Dalfó, C. |
2009 |
34 | C |
p. 579-584 6 p. |
artikel |
|
| 76 | On the chromatic numbers of small-dimensional Euclidean spaces |
Kupavskii, A.B. |
2009 |
34 | C |
p. 435-439 5 p. |
artikel |
|
| 77 | On the distribution of permanents of matrices over finite fields |
Vinh, Le Anh |
2009 |
34 | C |
p. 519-523 5 p. |
artikel |
|
| 78 | On the Gapped Consecutive-Ones Property |
Chauve, Cedric |
2009 |
34 | C |
p. 121-125 5 p. |
artikel |
|
| 79 | On the maximum number of cycles in outerplanar and series-parallel graphs |
de Mier, Anna |
2009 |
34 | C |
p. 489-493 5 p. |
artikel |
|
| 80 | On the Path Separability of Planar Graphs |
Diot, Emilie |
2009 |
34 | C |
p. 549-552 4 p. |
artikel |
|
| 81 | On the Plane-Width of Graphs |
Kamiński, Marcin |
2009 |
34 | C |
p. 633-637 5 p. |
artikel |
|
| 82 | On the Problem of Erdős and Hajnal in the Case of List Colorings |
Rozovskaya, A.P. |
2009 |
34 | C |
p. 387-391 5 p. |
artikel |
|
| 83 | On the reconstruction of graph invariants |
Kotek, T. |
2009 |
34 | C |
p. 375-379 5 p. |
artikel |
|
| 84 | On the S-Labeling problem |
Fertin, Guillaume |
2009 |
34 | C |
p. 273-277 5 p. |
artikel |
|
| 85 | On the Sumset Partition Problem |
Lladó, A. |
2009 |
34 | C |
p. 15-19 5 p. |
artikel |
|
| 86 | On the Superconnectivity in graphs with odd girth g and even girth h |
Montejano, Luis Pedro |
2009 |
34 | C |
p. 537-541 5 p. |
artikel |
|
| 87 | On the Tree-Width of Planar Graphs |
Dieng, Youssou |
2009 |
34 | C |
p. 593-596 4 p. |
artikel |
|
| 88 | Outerplanar Obstructions for the Feedback Vertex Set |
Rué, Juanjo |
2009 |
34 | C |
p. 167-171 5 p. |
artikel |
|
| 89 | Parameterized complexity of the maximum independent set problem and the speed of hereditary properties |
Lozin, Vadim V. |
2009 |
34 | C |
p. 127-131 5 p. |
artikel |
|
| 90 | Partition Critical Hypergraphs |
Füredi, Zoltán |
2009 |
34 | C |
p. 573-577 5 p. |
artikel |
|
| 91 | Pebbling Graphs of Diameter Three and Four |
Postle, Luke |
2009 |
34 | C |
p. 21-28 8 p. |
artikel |
|
| 92 | Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable |
Chen, Min |
2009 |
34 | C |
p. 659-667 9 p. |
artikel |
|
| 93 | Playing to retain the advantage |
Hefetz, Dan |
2009 |
34 | C |
p. 423-427 5 p. |
artikel |
|
| 94 | Properties of Groups for the Cage and Degree/Diameter Problems |
Jajcay, Robert |
2009 |
34 | C |
p. 341-345 5 p. |
artikel |
|
| 95 | Quasirandom broadcasting on the complete graph is as fast as randomized broadcasting |
Huber, Anna |
2009 |
34 | C |
p. 553-559 7 p. |
artikel |
|
| 96 | Quasirandom Rumor Spreading on Expanders |
Doerr, Benjamin |
2009 |
34 | C |
p. 243-247 5 p. |
artikel |
|
| 97 | Rainbow-free 3-colorings in abelian groups |
Montejano, Amanda |
2009 |
34 | C |
p. 133-137 5 p. |
artikel |
|
| 98 | Randomized algorithms for the majority problem |
Christofides, Demetres |
2009 |
34 | C |
p. 453-457 5 p. |
artikel |
|
| 99 | Short cycles in oriented graphs |
Osthus, Deryk |
2009 |
34 | C |
p. 369-373 5 p. |
artikel |
|
| 100 | Small clique and large chromatic number |
Raigorodskii, A.M. |
2009 |
34 | C |
p. 441-445 5 p. |
artikel |
|
| 101 | Some properties of edge intersection graphs of single bend paths on a grid |
Ries, Bernard |
2009 |
34 | C |
p. 29-33 5 p. |
artikel |
|
| 102 | Spanning galaxies in digraphs |
Gonçalves, Daniel |
2009 |
34 | C |
p. 139-143 5 p. |
artikel |
|
| 103 | Spanning trees in 3-connected K 3,t-minor-free graphs |
Ota, Katsuhiro |
2009 |
34 | C |
p. 145-149 5 p. |
artikel |
|
| 104 | Spectral radius of finite and infinite planar graphs and of graphs of bounded genus (extended abstract) |
Dvořák, Zdeněk |
2009 |
34 | C |
p. 101-105 5 p. |
artikel |
|
| 105 | Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs |
Asadi, Arash |
2009 |
34 | C |
p. 81-87 7 p. |
artikel |
|
| 106 | The Colorful Helly Property for Hypergraphs |
Barbosa, Rommel M. |
2009 |
34 | C |
p. 647-651 5 p. |
artikel |
|
| 107 | The tripartite Ramsey number for trees |
Böttcher, Julia |
2009 |
34 | C |
p. 597-601 5 p. |
artikel |
|
| 108 | Unavoidable subhypergraphs: a-clusters |
Füredi, Zoltán |
2009 |
34 | C |
p. 63-67 5 p. |
artikel |
|
| 109 | Unifying the representation of symmetric crossing families and weakly partitive families |
Bui-Xuan, B.-M. |
2009 |
34 | C |
p. 329-333 5 p. |
artikel |
|
| 110 | Vertices of Degree k in Random Unlabeled Trees |
Panagiotou, Konstantinos |
2009 |
34 | C |
p. 41-45 5 p. |
artikel |
|
| 111 | Weighted perfect codes in Lee metric |
Dorbec, P. |
2009 |
34 | C |
p. 477-481 5 p. |
artikel |
|
| 112 | Wilson-Schreiber Colourings of Cubic Graphs |
Grannell, Mike J. |
2009 |
34 | C |
p. 225-229 5 p. |
artikel |
112 gevonden resultaten