nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A basic elementary extension of the Duchet–Meyniel theorem
|
Pedersen, Anders Sune |
|
2010 |
310 |
3 |
p. 480-488 9 p. |
artikel |
2 |
A conjecture of Neumann-Lara on infinite families of r -dichromatic circulant tournaments
|
Araujo-Pardo, Gabriela |
|
2010 |
310 |
3 |
p. 489-492 4 p. |
artikel |
3 |
All countable monoids embed into the monoid of the infinite random graph
|
Bonato, Anthony |
|
2010 |
310 |
3 |
p. 373-375 3 p. |
artikel |
4 |
A multiply intersecting Erdős–Ko–Rado theorem — The principal case
|
Tokushige, Norihide |
|
2010 |
310 |
3 |
p. 453-460 8 p. |
artikel |
5 |
A note on the subgraphs of the ( 2 × ∞ ) -grid
|
Díaz, Josep |
|
2010 |
310 |
3 |
p. 531-536 6 p. |
artikel |
6 |
Another step towards proving a conjecture by Plummer and Toft
|
Horňák, Mirko |
|
2010 |
310 |
3 |
p. 442-452 11 p. |
artikel |
7 |
Antibandwidth of three-dimensional meshes
|
Török, L’ubomír |
|
2010 |
310 |
3 |
p. 505-510 6 p. |
artikel |
8 |
Anticoloring and separation of graphs
|
Berend, D. |
|
2010 |
310 |
3 |
p. 390-399 10 p. |
artikel |
9 |
Colorings at minimum cost
|
Berke, Robert |
|
2010 |
310 |
3 |
p. 561-569 9 p. |
artikel |
10 |
Distance-hereditary graphs and signpost systems
|
Nebeský, Ladislav |
|
2010 |
310 |
3 |
p. 527-530 4 p. |
artikel |
11 |
Enumeration of unrooted hypermaps of a given genus
|
Mednykh, Alexander |
|
2010 |
310 |
3 |
p. 518-526 9 p. |
artikel |
12 |
Factorizations of complete graphs into caterpillars of diameter 5
|
Fronček, Dalibor |
|
2010 |
310 |
3 |
p. 537-556 20 p. |
artikel |
13 |
Fulleroids with dihedral symmetry
|
Kardoš, František |
|
2010 |
310 |
3 |
p. 652-661 10 p. |
artikel |
14 |
Hall number for list colorings of graphs: Extremal results
|
Tuza, Zsolt |
|
2010 |
310 |
3 |
p. 461-470 10 p. |
artikel |
15 |
How to avoid using the Regularity Lemma: Pósa’s conjecture revisited
|
Levitt, Ian |
|
2010 |
310 |
3 |
p. 630-641 12 p. |
artikel |
16 |
How to play the Majority game with a liar
|
Butler, Steve |
|
2010 |
310 |
3 |
p. 622-629 8 p. |
artikel |
17 |
Minimal sumsets in finite solvable groups
|
Eliahou, Shalom |
|
2010 |
310 |
3 |
p. 471-479 9 p. |
artikel |
18 |
Note on robust critical graphs with large odd girth
|
Năstase, E. |
|
2010 |
310 |
3 |
p. 499-504 6 p. |
artikel |
19 |
On cycle lengths in claw-free graphs with complete closure
|
Ryjáček, Zdeněk |
|
2010 |
310 |
3 |
p. 570-574 5 p. |
artikel |
20 |
On facets of stable set polytopes of claw-free graphs with stability number 3
|
Pêcher, Arnaud |
|
2010 |
310 |
3 |
p. 493-498 6 p. |
artikel |
21 |
On large light graphs in families of polyhedral graphs
|
Hajduk, Róbert |
|
2010 |
310 |
3 |
p. 417-422 6 p. |
artikel |
22 |
On the number of graphs with a given endomorphism monoid
|
Koubek, Václav |
|
2010 |
310 |
3 |
p. 376-384 9 p. |
artikel |
23 |
Operator decomposition of graphs and the reconstruction conjecture
|
Skums, P.V. |
|
2010 |
310 |
3 |
p. 423-429 7 p. |
artikel |
24 |
Posets, homomorphisms and homogeneity
|
Cameron, Peter J. |
|
2010 |
310 |
3 |
p. 604-613 10 p. |
artikel |
25 |
Preface
|
Kratochvíl, Jan |
|
2010 |
310 |
3 |
p. 371-372 2 p. |
artikel |
26 |
Random preorders and alignments
|
Cameron, Peter |
|
2010 |
310 |
3 |
p. 591-603 13 p. |
artikel |
27 |
Ring graphs and complete intersection toric ideals
|
Gitler, Isidoro |
|
2010 |
310 |
3 |
p. 430-441 12 p. |
artikel |
28 |
Some bounds on the injective chromatic number of graphs
|
Doyon, Alain |
|
2010 |
310 |
3 |
p. 585-590 6 p. |
artikel |
29 |
Sums and differences along Hamiltonian cycles
|
Lev, Vsevolod F. |
|
2010 |
310 |
3 |
p. 575-584 10 p. |
artikel |
30 |
The complexity of the weight problem for permutation and matrix groups
|
Cameron, Peter J. |
|
2010 |
310 |
3 |
p. 408-416 9 p. |
artikel |
31 |
The firefighter problem for cubic graphs
|
King, Andrew |
|
2010 |
310 |
3 |
p. 614-621 8 p. |
artikel |
32 |
The local spectra of regular line graphs
|
Fiol, M.A. |
|
2010 |
310 |
3 |
p. 511-517 7 p. |
artikel |
33 |
Total edge irregularity strength of complete graphs and complete bipartite graphs
|
Jendrol’, Stanislav |
|
2010 |
310 |
3 |
p. 400-407 8 p. |
artikel |
34 |
Toughness threshold for the existence of 2-walks in K 4 -minor-free graphs
|
Dvořák, Zdeněk |
|
2010 |
310 |
3 |
p. 642-651 10 p. |
artikel |
35 |
Triangle-free graphs whose independence number equals the degree
|
Brandt, Stephan |
|
2010 |
310 |
3 |
p. 662-669 8 p. |
artikel |
36 |
Tutte’s 5-flow conjecture for highly cyclically connected cubic graphs
|
Steffen, Eckhard |
|
2010 |
310 |
3 |
p. 385-389 5 p. |
artikel |
37 |
Two proofs of the Bermond–Thomassen conjecture for tournaments with bounded minimum in-degree
|
Bessy, Stéphane |
|
2010 |
310 |
3 |
p. 557-560 4 p. |
artikel |