|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
21 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A flow theory for the dichromatic number |
Hochstättler, Winfried |
2017 |
66 | C |
p. 160-167 8 p. |
artikel |
|
| 2 | A note on the simplex-cosimplex problem |
Adiprasito, Karim |
2017 |
66 | C |
p. 5-12 8 p. |
artikel |
|
| 3 | A SAT attack on the Erdős–Szekeres conjecture |
Balko, Martin |
2017 |
66 | C |
p. 13-23 11 p. |
artikel |
|
| 4 | Bootstrap percolation, and other automata |
Morris, Robert |
2017 |
66 | C |
p. 250-263 14 p. |
artikel |
|
| 5 | Bounded colorings of multipartite graphs and hypergraphs |
Kamčev, Nina |
2017 |
66 | C |
p. 235-249 15 p. |
artikel |
|
| 6 | Counting configuration-free sets in groups |
Rué, Juanjo |
2017 |
66 | C |
p. 281-307 27 p. |
artikel |
|
| 7 | Decomposing regular graphs with prescribed girth into paths of given length |
Botler, F. |
2017 |
66 | C |
p. 28-36 9 p. |
artikel |
|
| 8 | Definability equals recognizability for k -outerplanar graphs and l -chordal partial k -trees |
Jaffke, Lars |
2017 |
66 | C |
p. 191-234 44 p. |
artikel |
|
| 9 | Editorial Board |
2017 |
66 | C |
p. IFC- 1 p. |
artikel |
||
| 10 | Fractal property of the graph homomorphism order |
Fiala, Jiří |
2017 |
66 | C |
p. 101-109 9 p. |
artikel |
|
| 11 | Harmonious and achromatic colorings of fragmentable hypergraphs |
Dębski, Michał |
2017 |
66 | C |
p. 60-80 21 p. |
artikel |
|
| 12 | Helge Tverberg is eighty: A personal tribute |
Bárány, Imre |
2017 |
66 | C |
p. 24-27 4 p. |
artikel |
|
| 13 | Limits of discrete distributions and Gibbs measures on random graphs |
Coja-Oghlan, A. |
2017 |
66 | C |
p. 37-59 23 p. |
artikel |
|
| 14 | Limits of mappings |
Hosseini, Lucas |
2017 |
66 | C |
p. 145-159 15 p. |
artikel |
|
| 15 | [No title] |
Nešetřil, Jaroslav |
2017 |
66 | C |
p. 1-4 4 p. |
artikel |
|
| 16 | On graphs with a large number of edge-colorings avoiding a rainbow triangle |
Hoppen, Carlos |
2017 |
66 | C |
p. 168-190 23 p. |
artikel |
|
| 17 | On solution-free sets of integers |
Hancock, Robert |
2017 |
66 | C |
p. 110-128 19 p. |
artikel |
|
| 18 | On the generalised colouring numbers of graphs that exclude a fixed minor |
van den Heuvel, Jan |
2017 |
66 | C |
p. 129-144 16 p. |
artikel |
|
| 19 | On the minimum number of edges in triangle-free 5-critical graphs |
Postle, Luke |
2017 |
66 | C |
p. 264-280 17 p. |
artikel |
|
| 20 | Partitioning a triangle-free planar graph into a forest and a forest of bounded degree |
Dross, François |
2017 |
66 | C |
p. 81-94 14 p. |
artikel |
|
| 21 | Triangle-free graphs of tree-width t are ⌈ ( t + 3 ) ∕ 2 ⌉ -colorable |
Dvořák, Zdeněk |
2017 |
66 | C |
p. 95-100 6 p. |
artikel |
21 gevonden resultaten