|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
92 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | Acyclic dominating partitions |
Addario-Berry, Louigi |
2007 |
29 | C |
p. 419-425 7 p. |
artikel |
|
| 2 | A fast algorithm to generate Beckett-Gray codes |
Sawada, Joe |
2007 |
29 | C |
p. 571-577 7 p. |
artikel |
|
| 3 | A minimum degree condition forcing a digraph to be k-linked |
Osthus, Deryk |
2007 |
29 | C |
p. 35-39 5 p. |
artikel |
|
| 4 | An approximate version of the Loebl-Komlós-Sós conjecture |
Piguet, Diana |
2007 |
29 | C |
p. 249-253 5 p. |
artikel |
|
| 5 | An infinite family of sharply two-arc transitive digraphs |
Mansilla, Sònia P. |
2007 |
29 | C |
p. 243-247 5 p. |
artikel |
|
| 6 | Approximation algorithms and hardness results for the clique packing problem |
Chataigner, F. |
2007 |
29 | C |
p. 397-401 5 p. |
artikel |
|
| 7 | Approximation of 3-Edge-Coloring of Cubic Graphs |
Kochol, Martin |
2007 |
29 | C |
p. 91-95 5 p. |
artikel |
|
| 8 | A Spectral Study of the Manhattan Networks |
Comellas, F. |
2007 |
29 | C |
p. 267-271 5 p. |
artikel |
|
| 9 | Asymptotics of the chromatic number for quasi-line graphs |
King, Andrew D. |
2007 |
29 | C |
p. 327-331 5 p. |
artikel |
|
| 10 | Bijective combinatorics of positive braids |
Albenque, Marie |
2007 |
29 | C |
p. 225-229 5 p. |
artikel |
|
| 11 | Bijective counting of plane bipolar orientations |
Fusy, Éric |
2007 |
29 | C |
p. 283-287 5 p. |
artikel |
|
| 12 | Bipartite operator decomposition of graphs and the reconstruction conjecture |
Skums, P.V. |
2007 |
29 | C |
p. 201-205 5 p. |
artikel |
|
| 13 | Bounds on the Number of Maximal Sum-Free Sets |
Wolfovitz, Guy |
2007 |
29 | C |
p. 321-325 5 p. |
artikel |
|
| 14 | Characterization of affine Steiner triple systems and Hall triple systems |
Král', Daniel |
2007 |
29 | C |
p. 17-21 5 p. |
artikel |
|
| 15 | Circular-imperfection of triangle-free graphs |
Kuhpfahl, Jens |
2007 |
29 | C |
p. 163-167 5 p. |
artikel |
|
| 16 | Claw-free circular-perfect graphs |
Pêcher, Arnaud |
2007 |
29 | C |
p. 451-455 5 p. |
artikel |
|
| 17 | Coloring circle graphs |
Černý, Jakub |
2007 |
29 | C |
p. 457-461 5 p. |
artikel |
|
| 18 | Constrained Ramsey Numbers |
Loh, Po-Shen |
2007 |
29 | C |
p. 41-45 5 p. |
artikel |
|
| 19 | Convex Partitions of Graphs |
Artigas, Danilo |
2007 |
29 | C |
p. 147-151 5 p. |
artikel |
|
| 20 | Detecting induced subgraphs |
Lévêque, Benjamin |
2007 |
29 | C |
p. 207-211 5 p. |
artikel |
|
| 21 | Deterministic Random Walks on Regular Trees |
Cooper, Joshua |
2007 |
29 | C |
p. 509-513 5 p. |
artikel |
|
| 22 | Discrepancy of Sums of two Arithmetic Progressions |
Hebbinghaus, Nils |
2007 |
29 | C |
p. 547-551 5 p. |
artikel |
|
| 23 | Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems |
Král', Daniel |
2007 |
29 | C |
p. 23-27 5 p. |
artikel |
|
| 24 | Edge Multiplicity and Other Trace Functions |
Wiener, Gábor |
2007 |
29 | C |
p. 491-495 5 p. |
artikel |
|
| 25 | Embedding spanning subgraphs of small bandwidth |
Böttcher, Julia |
2007 |
29 | C |
p. 485-489 5 p. |
artikel |
|
| 26 | Enumeration of simple complete topological graphs |
Kynčl, Jan |
2007 |
29 | C |
p. 295-299 5 p. |
artikel |
|
| 27 | Extremal Graph Theory for Metric Dimension and Diameter |
Hernando, C. |
2007 |
29 | C |
p. 339-343 5 p. |
artikel |
|
| 28 | Fast winning strategies in positional games |
Hefetz, Dan |
2007 |
29 | C |
p. 213-217 5 p. |
artikel |
|
| 29 | Feasibility of the Mixed Postman Problem with Restrictions on the Edges |
Zaragoza Martínez, Francisco Javier |
2007 |
29 | C |
p. 79-83 5 p. |
artikel |
|
| 30 | Fibonacci polynomials: compositions and cyclic products |
Strehl, Volker |
2007 |
29 | C |
p. 255-259 5 p. |
artikel |
|
| 31 | Finding Paths between Graph Colourings: Computational Complexity and Possible Distances |
Bonsma, Paul |
2007 |
29 | C |
p. 463-469 7 p. |
artikel |
|
| 32 | Finite duality for some minor closed classes |
Nešetřil, Jaroslav |
2007 |
29 | C |
p. 579-585 7 p. |
artikel |
|
| 33 | Folding and Spiralling: The Word View |
Schaefer, Marcus |
2007 |
29 | C |
p. 101-105 5 p. |
artikel |
|
| 34 | Fully Optimal Bases and the Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids |
Gioan, Emeric |
2007 |
29 | C |
p. 365-371 7 p. |
artikel |
|
| 35 | Functions over finite fields that determine few directions |
Ball, Simeon |
2007 |
29 | C |
p. 185-188 4 p. |
artikel |
|
| 36 | Game chromatic number of Cartesian product graphs |
Peterin, Iztok |
2007 |
29 | C |
p. 353-357 5 p. |
artikel |
|
| 37 | Generalizations of Heilbronn's Triangle Problem |
Lefmann, Hanno |
2007 |
29 | C |
p. 553-557 5 p. |
artikel |
|
| 38 | Generalizations of Khovanskiĭ's theorem on growth of sumsets in abelian semigroups |
Jelínek, Vít |
2007 |
29 | C |
p. 273-276 4 p. |
artikel |
|
| 39 | Generating Functions and the Solutions of Full History Recurrence Equations |
Tang, Minh |
2007 |
29 | C |
p. 445-449 5 p. |
artikel |
|
| 40 | Graph classes with given 3-connected components: asymptotic counting and critical phenomena |
Giménez, Omer |
2007 |
29 | C |
p. 521-529 9 p. |
artikel |
|
| 41 | Graph coloring with no large monochromatic components |
Linial, Nathan |
2007 |
29 | C |
p. 115-122 8 p. |
artikel |
|
| 42 | Hamiltonian fault-tolerance of hypercubes |
Dvořák, Tomáš |
2007 |
29 | C |
p. 471-477 7 p. |
artikel |
|
| 43 | Homomorphisms and Polynomial Invariants of Graphs |
Garijo, D. |
2007 |
29 | C |
p. 539-545 7 p. |
artikel |
|
| 44 | How many points can be reconstructed from k projections? |
Matoušek, Jiří |
2007 |
29 | C |
p. 427-434 8 p. |
artikel |
|
| 45 | Induced Ramsey-type theorems |
Fox, Jacob |
2007 |
29 | C |
p. 53-58 6 p. |
artikel |
|
| 46 | Induced trees in triangle-free graphs |
Matoušek, Jiří |
2007 |
29 | C |
p. 307-313 7 p. |
artikel |
|
| 47 | Isometric embeddings of subdivided complete graphs in the hypercube |
Beaudou, Laurent |
2007 |
29 | C |
p. 277-281 5 p. |
artikel |
|
| 48 | Large Monochromatic Components in Two-colored Grids |
Matoušek, Jiří |
2007 |
29 | C |
p. 3-9 7 p. |
artikel |
|
| 49 | Lattice paths with periodic boundaries |
Kung, Joseph P.S. |
2007 |
29 | C |
p. 59-63 5 p. |
artikel |
|
| 50 | Linear Ramsey Numbers for Bounded-Degree Hypergrahps |
Ishigami, Yoshiyasu |
2007 |
29 | C |
p. 47-51 5 p. |
artikel |
|
| 51 | List Colouring Squares of Planar Graphs |
Havet, Frédéric |
2007 |
29 | C |
p. 515-519 5 p. |
artikel |
|
| 52 | Matching graphs of Hypercubes and Complete Bipartite Graphs |
Fink, Jiří |
2007 |
29 | C |
p. 345-351 7 p. |
artikel |
|
| 53 | Measurable sets with excluded distances |
Bukh, Boris |
2007 |
29 | C |
p. 65-71 7 p. |
artikel |
|
| 54 | New results on lower bounds for the number of (⩽ k)-facets |
Aichholzer, Oswin |
2007 |
29 | C |
p. 189-193 5 p. |
artikel |
|
| 55 | Normal Cayley digraphs on minimal non-abelian groups |
Alaeiyan, Mehdi |
2007 |
29 | C |
p. 123-127 5 p. |
artikel |
|
| 56 | NP for Combinatorialists |
Kun, Gábor |
2007 |
29 | C |
p. 373-381 9 p. |
artikel |
|
| 57 | On a Häggkvist's Conjecture with the Polynomial Method |
Cámara, M. |
2007 |
29 | C |
p. 559-563 5 p. |
artikel |
|
| 58 | On circle graphs with girth at least five |
Esperet, Louis |
2007 |
29 | C |
p. 129-133 5 p. |
artikel |
|
| 59 | On components of 2-factors in claw-free graphs |
Broersma, Hajo |
2007 |
29 | C |
p. 289-293 5 p. |
artikel |
|
| 60 | On embedding triconnected cubic graphs on point sets |
García, Alfredo |
2007 |
29 | C |
p. 531-538 8 p. |
artikel |
|
| 61 | On Finite Maximal Antichains in the Homomorphism Order |
Foniok, Jan |
2007 |
29 | C |
p. 389-396 8 p. |
artikel |
|
| 62 | On Hamilton Cycles in Locally Connected Graphs with Vertex Degree Constraints |
Orlovich, Yury L. |
2007 |
29 | C |
p. 169-173 5 p. |
artikel |
|
| 63 | On mixed codes with covering radius 1 and minimum distance 2 |
Haas, W. |
2007 |
29 | C |
p. 11-15 5 p. |
artikel |
|
| 64 | On Ramsey Type Problems in Combinatorial Geometry |
Raigorodskii, A.M. |
2007 |
29 | C |
p. 153-157 5 p. |
artikel |
|
| 65 | On Some Extremal Properties of Hypergraph Colorings |
Shabanov, D.A. |
2007 |
29 | C |
p. 97-100 4 p. |
artikel |
|
| 66 | On the Chromatic Numbers of R 2 and R 3 with Intervals of Forbidden Distances |
Ivanov, L.L. |
2007 |
29 | C |
p. 159-162 4 p. |
artikel |
|
| 67 | On the Cubicity of Interval Graphs |
Chandran, L. Sunil |
2007 |
29 | C |
p. 315-319 5 p. |
artikel |
|
| 68 | On the Erdős–Szekeres problem in combinatorial geometry |
Koshelev, V.A. |
2007 |
29 | C |
p. 175-177 3 p. |
artikel |
|
| 69 | On the general excess bound for binary codes with covering radius one |
Haas, Wolfgang |
2007 |
29 | C |
p. 301-305 5 p. |
artikel |
|
| 70 | On the packing chromatic number of Cartesian products, hexagonal lattice, and trees |
Brešar, Boštjan |
2007 |
29 | C |
p. 237-241 5 p. |
artikel |
|
| 71 | Optimizing diversity |
Frein, Yannick |
2007 |
29 | C |
p. 73-77 5 p. |
artikel |
|
| 72 | Oriented vertex and arc colorings of partial 2-trees |
Ochem, Pascal |
2007 |
29 | C |
p. 195-199 5 p. |
artikel |
|
| 73 | Partial Colorings of Unimodular Hypergraphs |
Doerr, Benjamin |
2007 |
29 | C |
p. 359-363 5 p. |
artikel |
|
| 74 | Partial Satisfaction of k-Satisfiable Formulas |
Käppeli, Claudia |
2007 |
29 | C |
p. 497-501 5 p. |
artikel |
|
| 75 | Preface |
Márquez, Alberto |
2007 |
29 | C |
p. 1-2 2 p. |
artikel |
|
| 76 | Ramsey numbers of sparse hypergraphs |
Kühn, Daniela |
2007 |
29 | C |
p. 29-33 5 p. |
artikel |
|
| 77 | Regular chromatic number and the lonely runner problem |
Barajas, J. |
2007 |
29 | C |
p. 479-483 5 p. |
artikel |
|
| 78 | Removing degeneracy may require unbounded dimension increase |
Matoušek, Jiří |
2007 |
29 | C |
p. 107-113 7 p. |
artikel |
|
| 79 | Removing Even Crossings on Surfaces |
Pelsmajer, Michael J. |
2007 |
29 | C |
p. 85-90 6 p. |
artikel |
|
| 80 | Sets of Gaps in Sequences of Frobenius' Problems with 3 Elements |
Aguiló-Gost, Francesc |
2007 |
29 | C |
p. 231-236 6 p. |
artikel |
|
| 81 | Size of Graphs with High Girth |
Abajo, E. |
2007 |
29 | C |
p. 179-183 5 p. |
artikel |
|
| 82 | Spectral and Geometric Properties of k-Walk-Regular Graphs |
Fiol, M.A. |
2007 |
29 | C |
p. 333-337 5 p. |
artikel |
|
| 83 | SPT(q, k, n)-Codes |
Sali, Attila |
2007 |
29 | C |
p. 403-409 7 p. |
artikel |
|
| 84 | Study of Critical Sets in Latin Squares by using the Autotopism Group |
Falcón, R.M. |
2007 |
29 | C |
p. 503-507 5 p. |
artikel |
|
| 85 | The Connectivity of addition Cayley graphs |
Grynkiewicz, David |
2007 |
29 | C |
p. 135-139 5 p. |
artikel |
|
| 86 | The crossing number of a projective graph is quadratic in the face–width |
Gitler, Isidoro |
2007 |
29 | C |
p. 219-223 5 p. |
artikel |
|
| 87 | The Hardness of Approximating Poset Dimension |
Hegde, Rajneesh |
2007 |
29 | C |
p. 435-443 9 p. |
artikel |
|
| 88 | The Multidimensional Manhattan Network |
Dalfó, C. |
2007 |
29 | C |
p. 383-387 5 p. |
artikel |
|
| 89 | The order of the largest complete minor in a random graph |
Fountoulakis, N. |
2007 |
29 | C |
p. 141-146 6 p. |
artikel |
|
| 90 | The t-improper chromatic number of random graphs |
Kang, Ross J. |
2007 |
29 | C |
p. 411-417 7 p. |
artikel |
|
| 91 | Two New Classes of Hamiltonian Graphs |
Arkin, Esther M. |
2007 |
29 | C |
p. 565-569 5 p. |
artikel |
|
| 92 | Vertex fusion under diameter constraints |
Comas, Marc |
2007 |
29 | C |
p. 261-265 5 p. |
artikel |
92 gevonden resultaten