|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
44 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A new proof of Seymour's 6-flow theorem |
DeVos, Matt |
2017 |
122 | C |
p. 187-195 9 p. |
artikel |
|
| 2 | A non-trivial upper bound on the threshold bias of the Oriented-cycle game |
Clemens, Dennis |
2017 |
122 | C |
p. 21-54 34 p. |
artikel |
|
| 3 | Antistrong digraphs |
Bang-Jensen, Jørgen |
2017 |
122 | C |
p. 68-90 23 p. |
artikel |
|
| 4 | A simple arithmetic criterion for graphs being determined by their generalized spectra |
Wang, Wei |
2017 |
122 | C |
p. 438-451 14 p. |
artikel |
|
| 5 | A stability result for the Katona theorem |
Frankl, P. |
2017 |
122 | C |
p. 869-876 8 p. |
artikel |
|
| 6 | Asymptotic enumeration of vertex-transitive graphs of fixed valency |
Potočnik, Primož |
2017 |
122 | C |
p. 221-240 20 p. |
artikel |
|
| 7 | Bounding and stabilizing realizations of biased graphs with a fixed group |
Neudauer, Nancy Ann |
2017 |
122 | C |
p. 149-166 18 p. |
artikel |
|
| 8 | Canonical tree-decompositions of a graph that display its k-blocks |
Carmesin, Johannes |
2017 |
122 | C |
p. 1-20 20 p. |
artikel |
|
| 9 | Cayley numbers with arbitrarily many distinct prime factors |
Dobson, Ted |
2017 |
122 | C |
p. 301-310 10 p. |
artikel |
|
| 10 | Colouring perfect graphs with bounded clique number |
Chudnovsky, Maria |
2017 |
122 | C |
p. 757-775 19 p. |
artikel |
|
| 11 | Construction of permutation snarks |
Hägglund, Jonas |
2017 |
122 | C |
p. 55-67 13 p. |
artikel |
|
| 12 | Counting and packing Hamilton cycles in dense graphs and oriented graphs |
Ferber, Asaf |
2017 |
122 | C |
p. 196-220 25 p. |
artikel |
|
| 13 | Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree |
Merker, Martin |
2017 |
122 | C |
p. 91-108 18 p. |
artikel |
|
| 14 | Decomposing highly edge-connected graphs into paths of any given length |
Botler, F. |
2017 |
122 | C |
p. 508-542 35 p. |
artikel |
|
| 15 | Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤2 |
Chen, Min |
2017 |
122 | C |
p. 741-756 16 p. |
artikel |
|
| 16 | Editorial Board |
2017 |
122 | C |
p. i- 1 p. |
artikel |
||
| 17 | Embedding the Erdős–Rényi hypergraph into the random regular hypergraph and Hamiltonicity |
Dudek, Andrzej |
2017 |
122 | C |
p. 719-740 22 p. |
artikel |
|
| 18 | Extremal H-colorings of trees and 2-connected graphs |
Engbers, John |
2017 |
122 | C |
p. 800-814 15 p. |
artikel |
|
| 19 | Flexibility of projective-planar embeddings |
Maharry, John |
2017 |
122 | C |
p. 241-300 60 p. |
artikel |
|
| 20 | Generalised Mycielski graphs, signature systems, and bounds on chromatic numbers |
Simons, Gord |
2017 |
122 | C |
p. 776-793 18 p. |
artikel |
|
| 21 | Graph parameters from symplectic group invariants |
Regts, Guus |
2017 |
122 | C |
p. 844-868 25 p. |
artikel |
|
| 22 | Irrelevant vertices for the planar Disjoint Paths Problem |
Adler, Isolde |
2017 |
122 | C |
p. 815-843 29 p. |
artikel |
|
| 23 | 5-list-coloring planar graphs with distant precolored vertices |
Dvořák, Zdeněk |
2017 |
122 | C |
p. 311-352 42 p. |
artikel |
|
| 24 | Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs |
Chen, Zhi-Hong |
2017 |
122 | C |
p. 167-186 20 p. |
artikel |
|
| 25 | Minors and dimension |
Walczak, Bartosz |
2017 |
122 | C |
p. 668-689 22 p. |
artikel |
|
| 26 | Monochromatic cycle partitions of graphs with large minimum degree |
DeBiasio, Louis |
2017 |
122 | C |
p. 634-667 34 p. |
artikel |
|
| 27 | Multiple list colouring of planar graphs |
Zhu, Xuding |
2017 |
122 | C |
p. 794-799 6 p. |
artikel |
|
| 28 | On sets not belonging to algebras and rainbow matchings in graphs |
Clemens, Dennis |
2017 |
122 | C |
p. 109-120 12 p. |
artikel |
|
| 29 | On the Corrádi–Hajnal theorem and a question of Dirac |
Kierstead, H.A. |
2017 |
122 | C |
p. 121-148 28 p. |
artikel |
|
| 30 | On the Ramsey–Turán number with small s-independence number |
Bennett, Patrick |
2017 |
122 | C |
p. 690-718 29 p. |
artikel |
|
| 31 | Ordered Ramsey numbers |
Conlon, David |
2017 |
122 | C |
p. 353-383 31 p. |
artikel |
|
| 32 | Properly colored and rainbow copies of graphs with few cherries |
Sudakov, Benny |
2017 |
122 | C |
p. 391-416 26 p. |
artikel |
|
| 33 | Ramsey goodness of paths |
Pokrovskiy, Alexey |
2017 |
122 | C |
p. 384-390 7 p. |
artikel |
|
| 34 | Rooted grid minors |
Marx, Daniel |
2017 |
122 | C |
p. 428-437 10 p. |
artikel |
|
| 35 | Small cores in 3-uniform hypergraphs |
Solymosi, David |
2017 |
122 | C |
p. 897-910 14 p. |
artikel |
|
| 36 | Square-free graphs are multiplicative |
Wrochna, Marcin |
2017 |
122 | C |
p. 479-507 29 p. |
artikel |
|
| 37 | Steinberg's Conjecture is false |
Cohen-Addad, Vincent |
2017 |
122 | C |
p. 452-456 5 p. |
artikel |
|
| 38 | The chromatic number of finite type-graphs |
Avart, Christian |
2017 |
122 | C |
p. 877-896 20 p. |
artikel |
|
| 39 | The generic rigidity of triangulated spheres with blocks and holes |
Cruickshank, James |
2017 |
122 | C |
p. 550-577 28 p. |
artikel |
|
| 40 | The intersection ring of matroids |
Hampe, Simon |
2017 |
122 | C |
p. 578-614 37 p. |
artikel |
|
| 41 | The number of colorings of planar graphs with no separating triangles |
Thomassen, Carsten |
2017 |
122 | C |
p. 615-633 19 p. |
artikel |
|
| 42 | 10-tough chordal graphs are Hamiltonian |
Kabela, Adam |
2017 |
122 | C |
p. 417-427 11 p. |
artikel |
|
| 43 | Turán problems and shadows II: Trees |
Kostochka, Alexandr |
2017 |
122 | C |
p. 457-478 22 p. |
artikel |
|
| 44 | When does the list-coloring function of a graph equal its chromatic polynomial |
Wang, Wei |
2017 |
122 | C |
p. 543-549 7 p. |
artikel |
44 gevonden resultaten