Discrete Mathematics Volume 309, Issue 01-13 (2009)
Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, network theory, enumeration, coding theory, block designs, the theory of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, polyhedra, combinatorial and discrete geometry, matrices, and discrete probability theory.
The journal was established in 1971, under the leadership of Peter Hammer, with an advisory board consisting of Claude Berge, M. Harrison, Victor Klee, Jack van Lint, and Gian-Carlo Rota. The very first article it published was written by Paul Erdős, who went on to publish a total of 84 papers in DM.
One of the oldest and leading journals in the field, Discrete Mathematics has published a number of articles by many well known combinatorialists. These include Noga Alon (25 papers), László Babai, Béla Bollobás (41 papers), Leonard Carlitz, Fan Chung (10 papers), Václav Chvátal, Don Coppersmith, Persi Diaconis, Philippe Flajolet, Ron Graham, Branko Grünbaum, Richard Guy, Gil Kalai, Daniel Kleitman (25 papers), Donald Knuth, László Lovász, Jaroslav Nešetřil (27 papers), Cheryl Praeger (11 papers), John Riordan, Marcel-Paul Schützenberger, Vera Sós (10 papers), Joel Spencer, Richard Stanley, Endre Szemerédi, W. T. Tutte, Herb Wilf, and Doron Zeilberger (16 papers).
The journal was one of the first in the area of discrete mathematics and remained the broadest. Over the years it grew enormously along with the growth of the field, reaching the point of publishing 3500 pages per year. Hammer remained the managing editor until his death in 2006. In 2007 the editorial structure was overhauled and the journal became more selective. The new editor-in-chief is Douglas West, with managing editor Wayne Goddard and six associate editors who consider submissions by subfields.
Volume 309, Issue 1, Pages 1-292 (6 January 2009)
A survey of known results and research areas for n-queens
Pages 1-31
Jordan Bell, Brett Stevens
A survey of selected recent results on total domination in graphs
Pages 32-63
Michael A. Henning
Cycles through 4 vertices in 3-connected graphs
Pages 64-76
Xuezheng Lv, Chengdong Yi
Edge-choosability of planar graphs without adjacent triangles or without 7-cycles
Pages 77-84
Jianfeng Hou, Guizhen Liu, Jiansheng Cai
The clique operator on matching and chessboard graphs
Pages 85-93
F. Larrion, M.A. Pizana, R. Villarroel-Flores
An algorithm for the numbers of endomorphisms on paths (DM13208)
Pages 94-103
Sr. Arworn
Two-factors in orientated graphs with forbidden transitions
Pages 104-112
Zdenek Dvorak
Domination in bipartite graphs
Pages 113-122
Jochen Harant, Dieter Rautenbach
The effect of redundancy on probability bounds
Pages 123-127
Fred M. Hoppe
Claw-free graphs are not universal fixers
Pages 128-133
E.J. Cockayne, R.G. Gibson, C.M. Mynhardt
Chromatic equivalence classes of complete tripartite graphs
Pages 134-143
G.L. Chia, Chee-Kit Ho
A sufficient condition for pancyclability of graphs
Pages 144-150
E. Flandrin, H. Li, B. Wei
The Andrews-Stanley partition function and Al-Salam-Chihara polynomials
Pages 151-175
Masao Ishikawa, Jiang Zeng
The stable set polytope for some extensions of P4-free graphs
Pages 176-187
Raffaele Mosca
A solitaire game played on 2-colored graphs
Pages 188-201
David Craft, Zevi Miller, Dan Pritikin
Total colorings of planar graphs without adjacent triangles
Pages 202-206
Xiang-Yong Sun, Jian-Liang Wu, Yu-Wen Wu, Jian-Feng Hou
On q-functional equations and excursion moments
Pages 207-230
Christoph Richard
The isomorphism classes of the generalized Petersen graphs
Pages 231-237
Alice Steimle, William Staton
On the well-coveredness of Cartesian products of graphs
Pages 238-246
Alexandra Ovetsky Fradkin
On locally spherical polytopes of type {5, 3, 5}
Pages 247-254
Michael I. Hartley, Dimitri Leemans
Critical groups for homeomorphism classes of graphs
Pages 255-258
Sheng Chen, Sheng Kui Ye
The left angle brackettright-pointing angle bracket-property of some classes of graphs
Pages 259-263
S. Aparna Lakshmanan, A. Vijayakumar
Super edge-connectivity of mixed Cayley graph
Pages 264-270
Jinyang Chen, Jixiang Meng, Lihong Huang
A realization of graph associahedra
Pages 271-276
Satyan L. Devadoss
Planar graphs decomposable into a forest and a matching
Pages 277-279
Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka, Naeem N. Sheikh
Equitable list coloring of planar graphs without 4- and 6-cycles
Pages 280-287
Qiong Li, Yuehua Bu
The Hamiltonian index of graphs
Pages 288-292
Yi Hong, Jian-Liang Lin, Zhi-Sui Tao, Zhi-Hong Chen
articles 1 - 27
http://ifile.it/eaqvcl1/DiMa2009d.ZIP
