http://scitation.aip.org/ SIAM Journal on Discrete Mathematics http://link.aip.org/link/?SJD/26/89/1&agg=rss David Cook and Uwe Nagel<br/> We introduce a construction on a flag complex that by means of modifying the associated graph generates a new flag complex whose $h$-vector is the face vector of the original complex. This construction yields a vertex-decomposable, hence CohenMacaulay, complex. From this we get a (nonnumerical) cha ... [SIAM J. Discrete Math. 26, 89 (2012)] published Thu Feb 9, 2012. http://link.aip.org/link/?SJD/26/77/1&agg=rss Petr Gregor, Riste Skrekovski, and Vida Vukasinovic<br/> A queue layout of a graph consists of a linear ordering $\sigma$ of its vertices and a partition of its edges into sets, called queues, such that in each set no two edges are nested with respect to $\sigma$. We show that the $n$-dimensional hypercube $Q_n$ has a layout into $n-\lfloor \log_2 n \rfl ... [SIAM J. Discrete Math. 26, 77 (2012)] published Thu Feb 9, 2012. http://link.aip.org/link/?SJD/26/71/1&agg=rss Janos Barat, Zoltan Furedi, Ida Kantor, Younjin Kim, and Balazs Patkos<br/> For a property $\Gamma$ and a family of sets ${\mathcal F}$, let $f({\mathcal F},\Gamma)$ be the size of the largest subfamily of ${\mathcal F}$ having property $\Gamma$. For a positive integer $m$, let $f(m,\Gamma)$ be the minimum of $f({\mathcal F},\Gamma)$ over all families of size $m$. A family ... [SIAM J. Discrete Math. 26, 71 (2012)] published Thu Feb 9, 2012. http://link.aip.org/link/?SJD/26/65/1&agg=rss Douglas S. Stones<br/> The sign of a Latin square is $-1$ if it has an odd number of rows and columns that are odd permutations; otherwise it is $+1$. Let $L^{\text{\scshape{even}}}_n$ and $L^{\text{\scshape{odd}}}_n$ be, respectively, the number of Latin squares of order $n$ with sign $+1$ and $-1$. The AlonTarsi conjec ... [SIAM J. Discrete Math. 26, 65 (2012)] published Thu Jan 26, 2012. http://link.aip.org/link/?SJD/26/52/1&agg=rss Hai-Yang Zhu, Xin-Zhong Lu, Cui-Qi Wang, and Ming Chen<br/> Wegner conjectured that for each planar graph $G$ with maximum degree $\Delta$ at least 4, $\chi(G^2)\leq\Delta+5$ if $4\leq\Delta\leq7$, and $\chi(G^2)\leq\lfloor \frac{3\Delta}{2}\rfloor +1$ if $\Delta\geq8$. Let $G$ be a planar graph without 4- and 5-cycles. In this paper, we discuss the $L(p,q) ... [SIAM J. Discrete Math. 26, 52 (2012)] published Thu Jan 26, 2012. http://link.aip.org/link/?SJD/26/39/1&agg=rss Minghui Jiang, Vincent Pilaud, and Pedro J. Tejada<br/> Given $k$ labelings of a finite $d$-dimensional cubical grid, define the combined distance between two labels to be the sum of the $\ell_1$-distance between the two labels in each labeling. We want to construct $k$ labelings which maximize the minimum combined distance between any two labels. When ... [SIAM J. Discrete Math. 26, 39 (2012)] published Tue Jan 24, 2012. http://link.aip.org/link/?SJD/26/30/1&agg=rss Don Coppersmith and Victor S. Miller<br/> A subset $V \subseteq \mathbb{F}_2^n$ is a tile if $\mathbb{F}_2^n$ can be covered by disjoint translates of $V$. In other words, $V$ is a tile if and only if there is a subset $A \subseteq \mathbb{F}_2^n$ such that $V+A = \mathbb{F}_2^n$ uniquely (i.e., $v + a = v' + a'$ implies that $v=v'$ and $a ... [SIAM J. Discrete Math. 26, 30 (2012)] published Tue Jan 17, 2012. http://link.aip.org/link/?SJD/26/15/1&agg=rss Domingos Dellamonica, Subrahmanyam Kalyanasundaram, Daniel Martin, Vojtech Rodl, and Asaf Shapira<br/> The FriezeKannan regularity lemma is a powerful tool in combinatorics. It has also found applications in the design of approximation algorithms and recently in the design of fast combinatorial algorithms for boolean matrix multiplication. The algorithmic applications of this lemma require one to ef ... [SIAM J. Discrete Math. 26, 15 (2012)] published Tue Jan 3, 2012. http://link.aip.org/link/?SJD/26/1/1&agg=rss Boris Alexeev, Alexandra Fradkin, and Ilhee Kim<br/> In the course of proving the strong perfect graph theorem, Chudnovsky, Robertson, Seymour, and Thomas showed that every perfect graph either belongs to one of five basic classes or admits one of several decompositions. Four of the basic classes are closed under the operation of taking induced subgr ... [SIAM J. Discrete Math. 26, 1 (2012)] published Tue Jan 3, 2012. http://link.aip.org/link/?SJD/25/1902/1&agg=rss A. W. M. Dress, K. T. Huber, J. Koolen, and V. Moulton<br/> Given a set $\Sigma$ of bipartitions of some finite set $X$ of cardinality at least $2$, one can associate to $\Sigma$ a canonical $X$-labeled graph $\mathcal{B}(\Sigma)$, called the Buneman graph. This graph has several interesting mathematical propertiesfor example, it is a median network and the ... [SIAM J. Discrete Math. 25, 1902 (2011)] published Tue Dec 20, 2011.