SIAM Journal on Discrete Mathematics, Volume 22

Volume 22, Number 1, 2008

• Tomás Feder, Pavol Hell, Jing Huang:
  Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms. 1-14
  
• Eleni Tzanaki:
  Faces of Generalized Cluster Complexes and Noncrossing Partitions. 15-30
  
• William P. Orrick:
  Switching Operations for Hadamard Matrices. 31-50
  
• Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic:
  Algorithms for Square-3PC(., .)-Free Berge Graphs. 51-71
  
• Hajo Broersma, Agostino Capponi, Daniël Paulusma:
  A New Algorithm for On-line Coloring Bipartite Graphs. 72-91
  
• Peter Dankelmann, Simon Mukwembi, Henda C. Swart:
  Average Distance and Edge-Connectivity I. 92-101
  
• Isolde Adler:
  Tree-Related Widths of Graphs and Hypergraphs. 102-123
  
• Gruia Calinescu, Adrian Dumitrescu, János Pach:
  Reconfigurations in Graphs and Grids. 124-138
  
• Zdenek Dvorak, Riste Skrekovski, Martin Tancer:
  List-Coloring Squares of Sparse Subcubic Graphs. 139-159
  
• Qunqiang Feng, Hosam M. Mahmoud, Alois Panholzer:
  Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees. 160-184
  
• Dániel Gerbner, Balázs Patkós:
  l-Chain Profile Vectors. 185-193
  
• Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
  Planarity, Colorability, and Minor Games. 194-212
  
• Jeong-Hyun Kang:
  L(2, 1)-Labeling of Hamiltonian graphs with Maximum Degree 3. 213-230
  
• Frédéric Havet, Jean-Sébastien Sereni, Riste Skrekovski:
  3-Facial Coloring of Plane Graphs. 231-247
  
• Jun Wang, Huajun Zhang:
  Normalized Matching Property of Restricted Subspace Lattices. 248-255
  
• Navin Kashyap:
  Matroid Pathwidth and Code Trellis Complexity. 256-272
  
• Marko J. Moisio:
  On the Duals of Binary Hyper-Kloosterman Codes. 273-287
  
• Genghua Fan, Chuixiang Zhou:
  Ore Condition and Nowhere-Zero 3-Flows. 288-294
  
• Jirí Matousek, Ales Prívetivý:
  Large Monochromatic Components in Two-Colored Grids. 295-311
  
• Andrei A. Krokhin, Benoit Larose:
  Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction. 312-328
  
• Cláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed:
  On Planar Quasi-Parity Graphs. 329-347
  
• Mei-Chu Chang, Chui Zhi Yao:
  An Explicit Bound On Double Exponential Sums Related to Diffie--Hellman Distributions. 348-359
  
• Amos Beimel, Tamir Tassa, Enav Weinreb:
  Characterizing Ideal Weighted Threshold Secret Sharing. 360-397
  
• Alexandr V. Kostochka, Xuding Zhu:
  Adapted List Coloring of Graphs and Hypergraphs. 398-408
  
• Min Chih Lin, Jayme Luiz Szwarcfiter:
  Unit Circular-Arc Graph Representations and Feasible Circulations. 409-423
  

Volume 22, Number 2, 2008

• Reza Akhtar, Tao Jiang, Zevi Miller:
  Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs. 425-449
  
• David Offner:
  Polychromatic Colorings of Subcubes of the Hypercube. 450-454
  
• Dillon Mayhew:
  Matroid Complexity and Nonsuccinct Descriptions. 455-466
  
• Vojtech Rödl, Mark H. Siggers:
  On Ramsey Minimal Graphs. 467-488
  
• János Körner, Claudia Malvenuto, Gábor Simonyi:
  Graph-Different Permutations. 489-499
  
• Rong Luo, Rui Xu, Wenan Zang, Cun-Quan Zhang:
  Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows. 500-519
  
• Prasad Chebolu, Alan M. Frieze:
  Hamilton Cycles in Random Lifts of Directed Graphs. 520-540
  
• Daniel Král, Matej Stehlík:
  Coloring of Triangle-Free Graphs on the Double Torus. 541-553
  
• Paul Dorbec, Michel Mollard, Sandi Klavzar, Simon Spacapan:
  Power Domination in Product Graphs. 554-567
  
• Zdenek Dvorak, Riste Skrekovski, T. Valla:
  Planar Graphs of Odd-Girth at Least 9 are Homomorphic to the Petersen Graph. 568-591
  
• Steve Butler, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton:
  Hat Guessing Games. 592-605
  
• Angel Corberán, Isaac Plana, José M. Sanchis:
  The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra. 606-628
  
• Shlomo Ahal, Yuri Rabinovich:
  On Complexity of the Subpattern Problem. 629-649
  
• Pascale Charpin, Gohar M. M. Kyureghyan:
  Cubic Monomial Bent Functions: A Subclass of M. 650-665
  
• Sang-il Oum:
  Rank-Width and Well-Quasi-Ordering. 666-682
  
• Chris D. Godsil, M. W. Newman:
  Coloring an Orthogonality Graph. 683-692
  
• Uriel Feige, Eran Ofek:
  Finding a Maximum Independent Set in a Sparse Random Graph. 693-718
  
• Brendan D. McKay, Ian M. Wanless:
  A Census of Small Latin Hypercubes. 719-736
  
• D. Siersma, M. van Manen:
  The Nine Morse Generic Tetrahedra. 737-746
  
• Josep Díaz, Xavier Pérez, Maria J. Serna, Nicholas C. Wormald:
  Walkers on the Cycle and the Grid. 747-775
  
• David Eisenstat, Gary Gordon, Amanda Redlich:
  Combinatorial Properties of a Rooted Graph Polynomial. 776-785
  
• Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron:
  Testing Triangle-Freeness in General Graphs. 786-819
  
• Landon Rabern:
  A Note On Reed's Conjecture. 820-827
  
• Rom Pinchasi:
  The Minimum Number of Distinct Areas of Triangles Determined by a Set of n Points in the Plane. 828-831
  
• Arvind Gupta, Jan van den Heuvel, Ján Manuch, Ladislav Stacho, Xiaohong Zhao:
  On the Complexity of Ordered Colorings. 832-847
  

Volume 22, Number 3, 2008

• Zsolt Tuza:
  Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs. 849-853
  
• Jácint Szabó:
  Matroid Parity and Jump Systems: A Solution to a Conjecture of Recski. 854-860
  
• Tomás Kaiser, Riste Skrekovski:
  Cycles Intersecting Edge-Cuts of Prescribed Sizes. 861-874
  
• Nathan Reading:
  Chains in the Noncrossing Partition Lattice. 875-886
  
• József Balogh, Stephen G. Hartke, Qi Liu, Gexin Yu:
  On the First-Fit Chromatic Number of Graphs. 887-900
  
• Yael Berstein, Jon Lee, Hugo Maruri-Aguilar, Shmuel Onn, Eva Riccomagno, Robert Weismantel, Henry P. Wynn:
  Nonlinear Matroid Optimization and Experimental Design. 901-919
  
• Paul S. Bonsma:
  Spanning Trees with Many Leaves in Graphs With Minimum Degree Three. 920-937
  
• Richard C. Brewster, Tomás Feder, Pavol Hell, Jing Huang, Gary MacGillivray:
  Near-Unanimity Functions and Varieties of Reflexive Graphs. 938-960
  
• Bhalchandra D. Thatte:
  Combinatorics of Pedigrees I: Counterexamples to a Reconstruction Question. 961-970
  
• Heping Zhang, Peter Che Bor Lam, Wai Chee Shiu:
  Resonance Graphs and a Binary Coding for the 1-Factors of Benzenoid Systems. 971-984
  
• Russell Kirk, Hua Wang:
  Largest Number of Subtrees of Trees with a Given Maximum Degree. 985-995
  
• Jerrold R. Griggs, Xiaohua Teresa Jin:
  Real Number Channel Assignments for Lattices. 996-1021
  
• Anne Bergeron, Cedric Chauve, Fabien de Montgolfier, Mathieu Raffinot:
  Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs. 1022-1039
  
• Susan S. Wang:
  Structure and Coloring of Graphs with Only Small Odd Cycles. 1040-1072