Commutativity conditions for groups arising from acyclic directed graphs and posets Fulltext Access 7 Pages 2011
A generalization of Meshulam’s theorem on subsets of finite abelian groups with no 3-term arithmetic progression (II) Fulltext Access 7 Pages 2011
Nonexistence of exceptional imprimitive QQ-polynomial association schemes with six classes Fulltext Access 7 Pages 2011
The k-independence number of direct products of graphs and Hedetniemi's conjecture Fulltext Access 7 Pages 2011
Forbidden structures for efficient First-Fit chain partitioning (extended abstract) Fulltext Access 7 Pages 2011
Minor-minimal non-projective planar graphs with an internal 3-separation Fulltext Access 7 Pages 2011
A sufficient condition for the existence of an anti-directed 2-factor in a directed graph Fulltext Access 7 Pages 2011
Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs Fulltext Access 7 Pages 2011
Linear connectivity forces large complete bipartite minors: An alternative approach Fulltext Access 7 Pages 2011
Nordhaus–Gaddum-type theorem for Wiener index of graphs when decomposing into three parts Fulltext Access 7 Pages 2011
Characterization and representation problems for intersection betweennesses Fulltext Access 7 Pages 2011
Minimum average congestion of enhanced and augmented hypercubes into complete binary trees Fulltext Access 7 Pages 2011
The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes Fulltext Access 7 Pages 2011
On the construction of prefix-free and fix-free codes with specified codeword compositions Fulltext Access 7 Pages 2011
An axiomatic study of Majority-rule (+ ) and associated consensus functions on hierarchies Fulltext Access 7 Pages 2011
An efficient algorithm for computing the distance between close partitions Fulltext Access 7 Pages 2011
Discrepancy of Centered Arithmetic Progressions in Zp (Extended Abstract) Fulltext Access 8 Pages 2011
Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength Fulltext Access 8 Pages 2011
A class of graph-geodetic distances generalizing the shortest-path and the resistance distances Fulltext Access 8 Pages 2011