Note on strict-double-bound numbers of nearly complete graphs missing some edges Fulltext Access 4 Pages 2012
On the number of unlabeled vertices in edge-friendly labelings of graphs Fulltext Access 4 Pages 2012
Bijective mapping preserving intersecting antichains for kk-valued cubes Fulltext Access 4 Pages 2012
NoteA proof of two conjectures on the RandiÄ index and the average eccentricity Fulltext Access 4 Pages 2012
A semigroup proof of the bounded degree case of S.B. Raoʼs Conjecture on degree sequences and a bipartite analogue Fulltext Access 4 Pages 2012
A generalization of the Erdős–Ko–Rado theorem to tt-designs in certain semilattices Fulltext Access 5 Pages 2012
Dual concepts of almost distance-regularity and the spectral excess theorem Fulltext Access 5 Pages 2012
On the difference between chromatic number and dynamic chromatic number of graphs Fulltext Access 5 Pages 2012
NoteEvery 3-connected essentially 10-connected line graph is Hamilton-connected Fulltext Access 5 Pages 2012
Linear codes arising from the Gale transform of distinguished subsets of some projective spaces Fulltext Access 5 Pages 2012
Integrating Systems around the User: Combining Isabelle, Maple, and QEPCAD in the Proverʼs Palette Fulltext Access 5 Pages 2012
A note on the parameterized complexity of unordered maximum tree orientation Fulltext Access 5 Pages 2012
Optimal stopping in a search for a vertex with full degree in a random graph Fulltext Access 5 Pages 2012
Pooling designs with surprisingly high degree of error correction in a finite vector space Fulltext Access 5 Pages 2012
On stable cycles and cycle double covers of graphs with large circumference Fulltext Access 5 Pages 2012
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number Fulltext Access 5 Pages 2012
Laplacian spectral characterization of some graphs obtained by product operation Fulltext Access 5 Pages 2012
(Δ+1Δ+1)-total choosability of planar graphs with no cycles of length from 4 to kk and without close triangles Fulltext Access 5 Pages 2012
A sufficient condition for Kim’s conjecture on the competition numbers of graphs Fulltext Access 5 Pages 2012
Counterexamples to a monotonicity conjecture for the threshold pebbling number Fulltext Access 5 Pages 2012