An upper bound for the circuit complexity of existentially quantified Boolean formulas Fulltext Access 7 Pages 2010
Supereulerianity of kk-edge-connected graphs with a restriction on small bonds Fulltext Access 7 Pages 2010
Total edge irregularity strength of complete graphs and complete bipartite graphs Fulltext Access 8 Pages 2010
The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs Fulltext Access 8 Pages 2010
Combinatorial proofs of an identity from Ramanujan’s lost notebook and its variations Fulltext Access 8 Pages 2010
Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable Fulltext Access 8 Pages 2010
Polynomial-time dualization of rr-exact hypergraphs with applications in geometry Fulltext Access 8 Pages 2010
Convolution–multiplication identities for Tutte polynomials of graphs and matroids Fulltext Access 8 Pages 2010
Locally subquadrangular hyperplanes in symplectic and Hermitian dual polar spaces Fulltext Access 8 Pages 2010
A proof of Bressoud’s conjecture related to the Rogers–Ramanujan identities Fulltext Access 8 Pages 2010
Some characterizations of strongly regular graphs with respect to their vertex deleted subgraphs Fulltext Access 8 Pages 2010
On the simple connectedness of hyperplane complements in dual polar spaces, II Fulltext Access 8 Pages 2010
Strong order-preserving renaming in the synchronous message passing model Fulltext Access 8 Pages 2010
Dynamic programming based algorithms for set multicover and multiset multicover problems Fulltext Access 8 Pages 2010
Game authority for robust and scalable distributed selfish-computer systems Fulltext Access 8 Pages 2010
Lower bounds for the domination number and the total domination number of direct product graphs Fulltext Access 8 Pages 2010
Not complementary connected and not CIS dd-graphs form weakly monotone families Fulltext Access 8 Pages 2010