|
Journals in DBLP
Eur. J. Comb. 2009, volume: 30, number: 2
Vertex percolation on expander graphs. [Citation Graph (, )][DBLP]
An upper bound on adaptable choosability of graphs. [Citation Graph (, )][DBLP]
Bicycles and left-right tours in locally finite graphs. [Citation Graph (, )][DBLP]
On expansive graphs. [Citation Graph (, )][DBLP]
A constraint on the biembedding of Latin squares. [Citation Graph (, )][DBLP]
A note on affinely regular polygons. [Citation Graph (, )][DBLP]
Some three-color Ramsey numbers, R(P4, P5, Ck) and R(P4, P6, Ck). [Citation Graph (, )][DBLP]
A new proof of the Erdös-Ko-Rado theorem for intersecting families of permutations. [Citation Graph (, )][DBLP]
A new proof of a theorem of Littlewood. [Citation Graph (, )][DBLP]
On a theorem of Sewell and Trotter. [Citation Graph (, )][DBLP]
Upper bounds on the Witten index for supersymmetric lattice models by discrete Morse theory. [Citation Graph (, )][DBLP]
Subsequence sums of a zero-sumfree sequence. [Citation Graph (, )][DBLP]
The subconstituent algebra of a Latin square. [Citation Graph (, )][DBLP]
Inversive pseudorandom numbers over Galois rings. [Citation Graph (, )][DBLP]
On the nucleus of the Grassmann embedding of the symplectic dual polar space I, I. [Citation Graph (, )][DBLP]
On theta-episturmian words. [Citation Graph (, )][DBLP]
Tilings in Lee metric. [Citation Graph (, )][DBLP]
Hom complexes and homotopy theory in the category of graphs. [Citation Graph (, )][DBLP]
Palindromic richness. [Citation Graph (, )][DBLP]
Staircase rook polynomials and Cayley's game of Mousetrap. [Citation Graph (, )][DBLP]
Hypermaps and indecomposable permutations. [Citation Graph (, )][DBLP]
Cycle-free chessboard complexes and symmetric homology of algebras. [Citation Graph (, )][DBLP]
A Tutte polynomial which distinguishes rooted unicyclic graphs. [Citation Graph (, )][DBLP]
Spectral structure of the Laplacian on a covering graph. [Citation Graph (, )][DBLP]
On orbits of antichains of positive roots. [Citation Graph (, )][DBLP]
Every line graph of a 4-edge-connected graph is I-connected. [Citation Graph (, )][DBLP]
One-matching bi-Cayley graphs over abelian groups. [Citation Graph (, )][DBLP]
On a generalization of the van der Waerden Theorem. [Citation Graph (, )][DBLP]
|