Volume 160, Numbers 1-2, January 2012

Contributions

• 
  Hosam Abdo, Darko Dimitrov, Ivan Gutman: On the Zagreb indices equality. 1-8
• 
  Rangaswami Balakrishnan, T. Kavaskar: b-coloring of Kneser graphs. 9-14
• 
  A. Bellanger, Adam Janiak, Mikhail Y. Kovalyov, Ammar Oulamara: Scheduling an unbounded batching machine with job processing time compatibilities. 15-23
• 
  Enrique Bendito, Angeles Carmona, Andrés M. Encinas: The Kirchhoff indices of join networks. 24-37
• 
  Daniel K. Benvenuti, Abraham P. Punnen: Three value TSP and linkages with the three value linear spanning 2-forests. 38-52
• 
  Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann: On Bounded-Degree Vertex Deletion parameterized by treewidth. 53-60
• 
  Yacine Boufkhad, Thomas Hugel: Estimating satisfiability. 61-80
• 
  Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan: A shortest path-based approach to the multileaf collimator sequencing problem. 81-99
• 
  Yeow Meng Chee, Lijun Ji, Andrew Lim, Anthony K. H. Tung: Arboricity: An acyclic hypergraph decomposition problem motivated by database theory. 100-107
• 
  Gong Chen, Zhongxun Zhu: The number of independent sets of unicyclic graphs with given matching number. 108-115
• 
  Amir Daneshgar, Ramin Javadi: On the complexity of isoperimetric problems on trees. 116-131
• 
  Emilio Di Giacomo, Walter Didimo, Peter Eades, Seok-Hee Hong, Giuseppe Liotta: Bounds on the crossing resolution of complete geometric graphs. 132-139
• 
  Ramiro Feria-Purón, Guillermo Pineda-Villavicencio: On bipartite graphs of defect at most 4. 140-154
• 
  Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Containment relations in split graphs. 155-163
• 
  Michael A. Henning, Adel P. Kazemi: Total domination in inflated graphs. 164-169
• 
  Hongbo Hua, Shenggui Zhang, Kexiang Xu: Further results on the eccentric distance sum. 170-180

Notes

• 
  Bojan Basic: Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words. 181-186
• 
  Yun Ding, Rosena R. X. Du: Counting humps in Motzkin paths. 187-191
• 
  Stefano Gualandi, Federico Malucelli: A simple branching scheme for vertex coloring problems. 192-196

Volume 160, Number 3, February 2012

Contributions

• 
  Qiaoming Han, Abraham P. Punnen: Strong and weak edges of a graph and linkages with the vertex cover problem. 197-203
• 
  Aleksandar Ilic, Bo Zhou: On reformulated Zagreb indices. 204-209
• 
  Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri, Asghar Asgharian-Sardroud: A linear-time algorithm for the longest path problem in rectangular grid graphs. 210-217
• 
  Kewen Zhao, Yu-Jong Tzeng, Ping Zhang: Pancyclic graphs and degree sum and neighborhood union involving distance two. 218-223
• 
  Chandra Mohan Krishnamurthy, R. Sritharan: Maximum induced matching problem on hhd-free graphs. 224-230
• 
  Jing Li, Di Liu, Jun Yuan: Pancyclicity of k-ary n-cube networks with faulty vertices and edges. 231-238
• 
  Wu-Hsiung Lin, Gerard J. Chang: Equitable colorings of Cartesian products of graphs. 239-247
• 
  M. J. Morgan, Simon Mukwembi, Henda C. Swart: A lower bound on the eccentric connectivity index of a graph. 248-258
• 
  Carmen Ortiz, Mónica Villanueva: Maximal independent sets in caterpillar graphs. 259-266
• 
  K. Pattabiraman, P. Paulraja: On some topological indices of the tensor products of graphs. 267-279
• 
  Ricardo Riaza: Cyclic matrices of weighted digraphs. 280-290
• 
  Sheng-Yi Cai, Qi-Fan Yang: Online scheduling on three uniform machines. 291-302
• 
  Zhanjun Su, Sipeng Li, Jian Shen, Liping Yuan: On the relative distances of nine or ten points in the boundary of a plane convex body. 303-305
• 
  Zhou Xu, Dongsheng Xu, Wenbin Zhu: Approximation results for a min-max location-routing problem. 306-320
• 
  Kexiang Xu: Trees with the seven smallest and eight greatest Harary indices. 321-331
• 
  Li Zhang: A (3, 1)*-choosable theorem on toroidal graphs. 332-338

Notes

• 
  Michal Przykucki: Optimal stopping in a search for a vertex with full degree in a random graph. 339-343
• 
  Stefan Stanimirovic, Predrag S. Stanimirovic, Aleksandar Ilic: Ballot matrix as Catalan matrix power and related identities. 344-351
• 
  Jian-Hua Yin: A short constructive proof of A. R. Rao's characterization of potentially K_r+1-graphic sequences. 352-354

Volume 160, Numbers 4-5, March 2012

Special Section: Boolean and Pseudo-Boolean Functions

• 
  Martin Anthony, Joel Ratsaby: Robust cutpoints in the logical analysis of numerical data. 355-364
• 
  Ondrej Cepek, Petr Kucera, Petr Savický: Boolean functions with a simple certificate for CNF complexity. 365-382
• 
  Miguel Couceiro, Erkko Lehtonen, Tamás Waldhauser: The arity gap of order-preserving functions and extensions of pseudo-Boolean functions. 383-390
• 
  Thomas W. Cusick, Daniel Padgett: A recursive formula for weights of Boolean rotation symmetric functions. 391-397
• 
  Jacques Demongeot, Mathilde Noual, Sylvain Sené: Combinatorics of Boolean automata circuits dynamics. 398-415
• 
  Vladimir Kolmogorov: Generalized roof duality and bisubmodular functions. 416-426
• 
  Ziran Tu, Yingpu Deng: Boolean functions optimizing most of the cryptographic criteria. 427-435

Contributions

• 
  Sarah Spence Adams, Paul Booth, Harold Jaffe, Denise Sakai Troxell, S. Luke Zinnen: Exact lambda-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips. 436-447
• 
  Milica Andelic, Carlos M. da Fonseca, Slobodan K. Simic, Dejan V. Tosic: Connected graphs of fixed order and size with maximal Q-index: Some spectral bounds. 448-459
• 
  Drago Bokal, Bostjan Bresar, Janja Jerebic: A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks. 460-470
• 
  Andreas Brandstädt, Vassilis Giakoumakis, Frédéric Maffray: Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences. 471-478
• 
  Chan-Wei Chang, Ma-Lian Chia, Cheng-Ju Hsu, David Kuo, Li-Ling Lai, Fu-Hsing Wang: Global defensive alliances of trees and Cartesian product of paths and cycles. 479-487
• 
  Xue-Gang Chen, Shinya Fujita, Michitaka Furuya, Moo Young Sohn: Constructing connected bicritical graphs with edge-connectivity 2. 488-493
• 
  Marek Cygan, Marcin Pilipczuk: Bandwidth and distortion revisited. 494-504
• 
  Július Czap, Dávid Hudák: 1-planarity of complete multipartite graphs. 505-512
• 
  Nicole Eggemann, Steven D. Noble: The complexity of two graph orientation problems. 513-517
• 
  Jan Ekstein, Premysl Holub, Bernard Lidický: Packing chromatic number of distance graphs. 518-524
• 
  Ben Emanuel, Shmuel Wimer, Gershon Wolansky: Using well-solvable quadratic assignment problems for VLSI interconnect applications. 525-535
• 
  Chiara Epifanio, Christiane Frougny, Alessandra Gabriele, Filippo Mignosi, Jeffrey Shallit: Sturmian graphs and integer representations over numeration systems. 536-547
• 
  Jywe-Fei Fang, Chien-Hung Huang: Geodesic pancyclicity and balanced pancyclicity of the generalized base-b hypercube. 548-559
• 
  Xing Gao, Yanfeng Luo, Wenwen Liu: Kirchhoff index in line, subdivision and total graphs of a regular graph. 560-565
• 
  Yong Gao: Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs. 566-578
• 
  Yanmei Hong, Jixiang Meng, Zhao Zhang: Edge fault tolerance of graphs with respect to super edge connectivity. 579-587
• 
  Takuya Iimura, Kazuo Murota, Akihisa Tamura: Sperner's lemma and zero point theorems on a discrete simplex and a discrete simplotope. 588-592
• 
  Arnold Knopfmacher, Toufik Mansour: Record statistics in a random composition. 593-603
• 
  Daniel Lemire: The universality of iterated hashing over variable-length strings. 604-617
• 
  Kun Meng, Chuang Lin, Wen An Liu, Yang Yang, Gyula O. H. Katona: Minimum average-case queries of q+1-ary search game with small sets. 618-627
• 
  Pedro Miranda, Michel Grabisch: An algorithm for finding the vertices of the k-additive monotone core. 628-639
• 
  Ján Plávka: On the O(n³) algorithm for checking the strong robustness of interval fuzzy matrices. 640-647
• 
  T. Schiffer, Franz Aurenhammer, M. Demuth: Computing convex quadrangulations. 648-656
• 
  Lanzhen Song, William Staton, Bing Wei: Independence polynomials of some compound graphs. 657-663
• 
  Yingqian Wang, Qian Wu: Linear coloring of sparse graphs. 664-672

Notes

• 
  Stephen Bowser, Charles Cable: At least three minimal quasi-kernels. 673-675
• 
  Mustapha Chellali, Nader Jafari Rad, Abdollah Khodkar: On 3-y_t-vertex critical graphs of diameter three. 676-681

Volume 160, Number 6, April 2012

• 
  Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski: Guest editors' foreword. 683-684

Graph Classes

• 
  Ferdinando Cicalese, Martin Milanic: Graphs of separability at most 2. 685-696
• 
  Tomás Feder, Pavol Hell, Jing Huang, Arash Rafiey: Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms. 697-707
• 
  Emeric Gioan, Christophe Paul: Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs. 708-733
• 
  Petr A. Golovach, Pinar Heggernes, Rodica Mihai: Edge search number of cographs. 734-743
• 
  Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé: On spanning galaxies in digraphs. 744-754

Optimization

• 
  Karina Chudá, Martin Skoviera: L(2, 1)-labelling of generalized prisms. 755-763
• 
  Jirí Fiala, Petr A. Golovach, Jan Kratochvíl, Bernard Lidický, Daniël Paulusma: Distance three labelings of trees. 764-779
• 
  Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý: Parameterized complexity of generalized domination problems. 780-792
• 
  Torben Hagerup: A strengthened analysis of an algorithm for Dominating Set in planar graphs. 793-798
• 
  Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos: On graph contractions and induced minors. 799-809
• 
  Frank Kammer, Torsten Tholey: The complexity of minimum convex coloring. 810-833

Width Parameters

• 
  Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics: Polynomial-time recognition of clique-width ≤3 graphs. 834-865
• 
  Bruno Courcelle: On the model-checking of monadic second-order formulas with edge set quantifications. 866-887
• 
  Pinar Heggernes, Daniel Meister, Charis Papadopoulos: Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs. 888-901
• 
  David Knipe: Trimming weighted graphs of bounded treewidth. 902-912
• 
  Daniel Král': Decomposition width of matroids. 913-923

Volume 160, Numbers 7-8, May 2012

Special Section: Game Theory

• 
  Sylvain Béal, Eric Rémila, Philippe Solal: On the number of blocks required to access the core. 925-932
• 
  Vladimir I. Danilov, Alexander V. Karzanov, Gleb A. Koshevoy: Condorcet domains of tiling type. 933-940
• 
  Vladimir Gurvich: Further generalizations of the Wythoff game and the minimum excludant. 941-947
• 
  Nikolai S. Kukushkin: Cournot tâtonnement and dominance solvability in finite games. 948-958
• 
  Kitty Meeks, Alexander Scott: The complexity of flood-filling games on graphs. 959-969
• 
  Justo Puerto, Arie Tamir, Federico Perea: Cooperative location games based on the minimum diameter spanning Steiner subgraph problem. 970-979
• 
  Huang Shao, Wang Chao: Recursive method to solve the problem of "Gambling with God". 980-984

Contributions

• 
  Robert E. L. Aldred, Michael D. Plummer: Proximity thresholds for matching extension in the torus and Klein bottle. 985-991
• 
  Abbas Alhakim: Spans of preference functions for de Bruijn sequences. 992-998
• 
  Rémy Belmonte, Pinar Heggernes, Pim van 't Hof: Edge contractions in subclasses of chordal graphs. 999-1010
• 
  Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé: A parallelogram tile fills the plane by translation in at most two distinct ways. 1011-1018
• 
  Marianna Bolla, Tamás Kói, András Krámli: Testability of minimum balanced multiway cut densities. 1019-1027
• 
  Marcus Brazil, Charl J. Ras, Doreen A. Thomas: The bottleneck 2-connected k-Steiner network problem for k≤2. 1028-1038
• 
  Valentin E. Brimkov, Andrew Leach, Jimmy Wu, Michael Mastroianni: Approximation algorithms for a geometric set cover problem. 1039-1052
• 
  Yair Caro, Michael A. Henning: Directed domination in oriented graphs. 1053-1063
• 
  Ye Chen, Suohai Fan, Hong-Jian Lai, Huimin Song, Lei Sun: On dynamic coloring for planar graphs and graphs of higher genus. 1064-1071
• 
  Marc Demange, Gabriele Di Stefano, Benjamin Leroy-Beaulieu: On the online track assignment problem. 1072-1093
• 
  Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger: The interval ordering problem. 1094-1103
• 
  Shinya Fujita, Michitaka Furuya, Colton Magnant: k-Rainbow domatic numbers. 1104-1113
• 
  I. D. Gray, Jim A. MacDougall: Vertex-magic labeling of regular graphs: Disjoint unions and assemblages. 1114-1125
• 
  Brian Heinold: The sum choice number of P₃ P_n. 1126-1136
• 
  Michael A. Henning, Ernst J. Joubert, Justin Southey: Multiple factor Nordhaus-Gaddum type results for domination and total domination. 1137-1142
• 
  Michael A. Henning, Nader Jafari Rad: On α-total domination in graphs. 1143-1151
• 
  Hongbo Hua, Shenggui Zhang: On the reciprocal degree distance of graphs. 1152-1163
• 
  Fethi Jarray, Christophe Picouleau: Minimum decomposition into convex binary matrices. 1164-1175
• 
  Suh-Ryung Kim, Boram Park, Yoshio Sano: The competition numbers of complete multipartite graphs with many partite sets. 1176-1182
• 
  William Klostermeyer, Christina M. Mynhardt: Vertex covers and eternal dominating sets. 1183-1190
• 
  Ji Tian, T. C. E. Cheng, C. T. Ng, Jinjiang Yuan: An improved on-line algorithm for single parallel-batch machine scheduling with delivery times. 1191-1210
• 
  Qiaojun Shu, Weifan Wang, Yiqiao Wang: Acyclic edge coloring of planar graphs without 5-cycles. 1211-1223
• 
  Ge Xia, Yong Zhang: Kernelization for cycle transversal problems. 1224-1231
• 
  Weigen Yan, Yeong-Nan Yeh, Fuji Zhang: The asymptotic behavior of some indices of iterated line graphs of regular graphs. 1232-1239
• 
  Peng Zhang, Daming Zhu, Junfeng Luan: An approximation algorithm for the Generalized k-Multicut problem. 1240-1247
• 
  Jin-Xin Zhou: Super restricted edge connectivity of regular edge-transitive graphs. 1248-1252

Notes

• 
  Maddalena Cavicchioli: Acute triangulations of convex quadrilaterals. 1253-1256
• 
  Wei Dong: A note on entire choosability of plane graphs. 1257-1261
• 
  Alexander Grigoriev, Bert Marchal, Natalya Usotskaya, Ioan Todinca: A note on planar graphs with large width parameters and small grid-minors. 1262-1269
• 
  Stefan Gyürki: On the difference of the domination number of a digraph and of its reverse. 1270-1276
• 
  Sandi Klavzar, Khaled Salem: A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs. 1277-1280
• 
  Oliver Schaudt: On graphs for which the connected domination number is at most the total domination number. 1281-1284
• 
  Yingzhi Tian, Jixiang Meng, Zhao Zhang: On the connectivity of p-diamond-free vertex transitive graphs. 1285-1290

Communication

• 
  Guido Perboli, Roberto Tadei, Mauro Maria Baldi: The stochastic generalized bin packing problem. 1291-1297

Volume 160, Number 9, June 2012

Special Section: Computational Biology

• 
  Riccardo Dondi: New results for the Longest Haplotype Reconstruction problem. 1299-1310

Contributions

• 
  E. Abajo, Camino Balbuena, Ana Diánez: Girth of {C₃, ..., C_s}-free extremal graphs. 1311-1318
• 
  M. Alizadeh, A. K. Das, Hamid Reza Maimani, M. R. Pournaki, S. Yassemi: On the diameter and girth of zero-divisor graphs of posets. 1319-1324
• 
  Camino Balbuena, Pedro García-Vázquez, Adriana Hansberg, Luis Pedro Montejano: Restricted arc-connectivity of generalized p-cycles. 1325-1332
• 
  Mehdi Eliasi, Ghaffar Raeisi, Bijan Taeri: Wiener index of some graph operations. 1333-1344
• 
  Andreas Holtkamp, Dirk Meierling, Luis Pedro Montejano: k-restricted edge-connectivity in triangle-free graphs. 1345-1355
• 
  Dávid Hudák, Frantisek Kardos, Borut Luzar, Roman Sotak, Riste Skrekovski: Acyclic edge coloring of planar graphs with Δ colors. 1356-1368
• 
  Yuefeng Lin, S. D. Noble, Xian'an Jin, Wenfang Cheng: On plane graphs with link component number equal to the nullity. 1369-1375
• 
  K. Pattabiraman, P. Paulraja: Vertex and edge Padmakar-Ivan indices of the generalized hierarchical product of graphs. 1376-1384
• 
  André Raspaud, Li-Da Tong: The minimum identifying code graphs. 1385-1389

Notes

• 
  Patrick Bahls, Nicole A. Gin: Clawfreeness of the powers of a graph. 1390-1393
• 
  Oliver Schaudt: A note on connected dominating sets of distance-hereditary graphs. 1394-1398
• 
  Andrzej Wloch: On generalized Fibonacci numbers and k-distance K_p-matchings in graphs. 1399-1405

Volume 160, Numbers 10-11, July 2012

Special Section: Boolean and Pseudo-Boolean Functions

• 
  Martin Anthony: Generalization error bounds for the logical analysis of data. 1407-1415

Contributions

• 
  Tatsuya Akutsu, Daiji Fukagawa, Jesper Jansson, Kunihiko Sadakane: Inferring a graph from path frequency. 1416-1428
• 
  C. Araúz: The Kirchhoff indexes of some composite networks. 1429-1440
• 
  Boris Aronov, Delia Garijo, Yurai Núñez Rodríguez, David Rappaport, Carlos Seara, Jorge Urrutia: Minimizing the error of linear separators on linearly inseparable data. 1441-1452
• 
  Yuichi Asahiro, Kenichi Kawahara, Eiji Miyano: NP-hardness of the sorting buffer problem on the uniform metric. 1453-1464
• 
  Daniel Berend, Amir Sapir, Shay Solomon: The Tower of Hanoi problem on Path_h graphs. 1465-1483
• 
  Pavel Chebotarev: The walk distances in graphs. 1484-1500
• 
  Yong-Gao Chen, Cui-Ying Hu: On a problem of Erdős, Herzog and Schönheim. 1501-1506
• 
  Geoffrey Exoo, Joan Gimbert, Nacho López, José Gómez: Radial Moore graphs of radius three. 1507-1512
• 
  Anna Fiedorowicz: Acyclic edge colouring of plane graphs. 1513-1523
• 
  Ana Paulina Figueroa, Bernardo Llano, Mika Olsen, Eduardo Rivera-Campo: On the acyclic disconnection of multipartite tournaments. 1524-1531
• 
  Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud: On the size of identifying codes in triangle-free graphs. 1532-1546
• 
  Steven D. Galbraith, Mark Holmes: A non-uniform birthday problem with applications to discrete logarithms. 1547-1560
• 
  Yubao Guo, Mei Lu, Michel Surmacs: Weakly quasi-Hamiltonian-set-connected multipartite tournaments. 1561-1566
• 
  Kiavash Kianfar: On n-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets. 1567-1582
• 
  Hwa Kyung Kim, Sang Hoon Lee: Generalized competition indices of symmetric primitive digraphs. 1583-1590
• 
  Boaz Patt-Shamir, Dror Rawitz: Vector bin packing with multiple-choice. 1591-1600
• 
  Dieter Rautenbach, Jayme Luiz Szwarcfiter: Unit and single point interval graphs. 1601-1609
• 
  Saeed Shaebani: On the b-chromatic number of regular graphs without 4-cycle. 1610-1614
• 
  Andrew V. Sills, Hua Wang: On the maximal Wiener index and related questions. 1615-1623
• 
  Sarah Spence Adams, Paul Booth, Denise Sakai Troxell, S. Luke Zinnen: Modeling the spread of fault in majority-based network systems: Dynamic monopolies in triangular grids. 1624-1633

Notes

• 
  Sebastian Böcker, Peter Damaschke: A note on the parameterized complexity of unordered maximum tree orientation. 1634-1638
• 
  Hsiang-Chun Hsu, Gerard Jennhwa Chang: Balanced k-decompositions of graphs. 1639-1642
• 
  Gaokui Xu, Shengjia Li, Qiaoping Guo, Hongwei Li: The solution and applications of a combinatorial problem. 1643-1649

Volume 160, Number 12, August 2012

Special Section: Boolean and Pseudo-Boolean Functions

• 
  Miguel Couceiro, Jean-Luc Marichal, Tamás Waldhauser: Locally monotone Boolean and pseudo-Boolean functions. 1651-1660

Contributions

• 
  Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh: On the approximability of some degree-constrained subgraph problems. 1661-1679
• 
  Manuel Bodirsky, Jan Kára, Barnaby Martin: The complexity of surjective homomorphism problems - a survey. 1680-1690
• 
  Gerard Jennhwa Chang, Paul Dorbec, Mickaël Montassier, André Raspaud: Generalized power domination of graphs. 1691-1698
• 
  Eddie Cheng, László Lipták: Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products. 1699-1716
• 
  Feodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang: Collective additive tree spanners for circle graphs and polygonal graphs. 1717-1729
• 
  Elke Eisenschmidt, Utz-Uwe Haus: Discovering all associations in discrete data using frequent minimally infrequent attribute sets. 1730-1741
• 
  Vladimir Gurvich, Mikhail Vyalyi: Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs. 1742-1756
• 
  Michael A. Henning, Christian Löwenstein: Hypergraphs with large domination number and with edge sizes at least three. 1757-1765
• 
  G. Marimuthu, M. Balakrishnan: E-super vertex magic labelings of graphs. 1766-1774
• 
  Dirk Meierling, Lutz Volkmann: Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected. 1775-1781
• 
  Mirka Miller, Hebert Pérez-Rosés, Joe Ryan: The maximum degree and diameter-bounded subgraph in the mesh. 1782-1790
• 
  Charis Papadopoulos: Restricted vertex multicut on permutation graphs. 1791-1797
• 
  Thomas A. Roemer, Reza Ahmadi, Sriram Dasu: The Traveling Salesman Problem with flexible coloring. 1798-1814
• 
  Bing Wang, Jianliang Wu: Total colorings of planar graphs without intersecting 5-cycles. 1815-1821
• 
  Bing Xue, Liancui Zuo, Guojun Li: The hamiltonicity and path t-coloring of Sierpiński-like graphs. 1822-1836
• 
  Weihua Yang, Hong-Jian Lai, Hao Li, Xiaofeng Guo: Collapsible graphs and Hamiltonian connectedness of line graphs. 1837-1844

Notes

• 
  Patrick Ali, Peter Dankelmann, Simon Mukwembi: Upper bounds on the Steiner diameter of a graph. 1845-1850
• 
  Jirí Fink, Borut Luzar, Riste Skrekovski: Some remarks on inverse Wiener index problem. 1851-1858
• 
  Toru Hasunuma, Mayu Otani: On the (h, k)-domination numbers of iterated line digraphs. 1859-1863
• 
  Vadim E. Levit, Eugen Mandrescu: Local maximum stable set greedoids stemming from very well-covered graphs. 1864-1871
• 
  Dieter Rautenbach, Zoltán Szigeti: Greedy colorings of words. 1872-1874

Volume 160, Numbers 13-14, September 2012

Special Section: Boolean and Pseudo-Boolean Functions

• 
  Marc D. Riedel, Jehoshua Bruck: Cyclic Boolean circuits. 1877-1900

Contributions

• 
  Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos: Online maximum k-coverage. 1901-1913
• 
  Joan Boyar, György Dósa, Leah Epstein: On the absolute approximation ratio for First Fit and related results. 1914-1923
• 
  Peter Brucker, Edmund K. Burke, Sven Groenemeyer: A mixed integer programming model for the cyclic job-shop problem with transportation. 1924-1935
• 
  Eddie Cheng, Marc J. Lipman, László Lipták: Matching preclusion and conditional matching preclusion for regular interconnection networks. 1936-1954
• 
  Alexandre Dolgui, Sergey Kovalev: Scenario based robust line balancing: Computational complexity. 1955-1963
• 
  Satoru Fujishige, Naoyuki Kamiyama: The root location problem for arc-disjoint arborescences. 1964-1970
• 
  Hortensia Galeana-Sánchez, Bernardo Llano, Juan José Montellano-Ballesteros: k-colored kernels. 1971-1978
• 
  Teresa W. Haynes, Michael A. Henning: A characterization of diameter-2-critical graphs whose complements are diamond-free. 1979-1985
• 
  Michael A. Henning, Nader Jafari Rad: Locating-total domination in graphs. 1986-1993
• 
  Leslie Hogben, My Huynh, Nicole Kingsley, Sarah Meyer, Shanise Walker, Michael Young: Propagation time for zero forcing on a graph. 1994-2005
• 
  László Lipták, Eddie Cheng, Jong-Seok Kim, Sung Won Kim: One-to-many node-disjoint paths of hyper-star networks. 2006-2014
• 
  J. W. Sander, T. Sander: The maximal energy of classes of integral circulant graphs. 2015-2029
• 
  Tadeja Kraner Sumenjak, Polona Pavlic, Aleksandra Tepeh: On the Roman domination in the lexicographic product of graphs. 2030-2036
• 
  Mark Walters: Small components in k-nearest neighbour graphs. 2037-2047
• 
  Xin Zhang, Guanghui Wang, Yong Yu, Jinbo Li, Guizhen Liu: On r-acyclic edge colorings of planar graphs. 2048-2053

Notes

• 
  Daniel Granot, Frieda Granot: On graphs which can or cannot induce Chinese Postman games with a non-empty core. 2054-2059
• 
  Garth Isaak, Peter Johnson, Caleb Petrie: Integer and fractional security in graphs. 2060-2062
• 
  Ye Wang, Yusheng Li: Lower bounds for Ramsey numbers of K_n with a small subgraph removed. 2063-2068
• 
  Heping Zhang, Wei Li: Computing the permanental polynomials of bipartite graphs by Pfaffian orientation. 2069-2074

Volume 160, Number 15, October 2012

Special Section: Game Theory

• 
  Alewyn P. Burger, M. van der Merwe, Jan H. van Vuuren: An asymptotic analysis of the evolutionary spatial prisoner's dilemma on a path. 2075-2088
• 
  Archontia C. Giannopoulou, Paul Hunter, Dimitrios M. Thilikos: LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth. 2089-2097

Contributions

• 
  Meysam Alishahi: Dynamic chromatic number of regular graphs. 2098-2103
• 
  Yoshikazu Aoshima, David Avis, Theresa Deering, Yoshitake Matsumoto, Sonoko Moriyama: On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes. 2104-2115
• 
  Jeong-Ok Choi, John P. Georges, David W. Mauro, Yan Wang: On real number labelings and graph invertibility. 2116-2130
• 
  Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk: Kernelization hardness of connectivity problems in d-degenerate graphs. 2131-2141
• 
  Ali Dehghan, Arash Ahadi: Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number. 2142-2146
• 
  Gilles Didier, Elisabeth Remy: Relations between gene regulatory networks and cell dynamics in Boolean models. 2147-2157
• 
  Eric Domenjoud, Damien Jamet, Damien Vergnaud, Laurent Vuillon: Enumeration formula for (2, n)-cubes in discrete planes. 2158-2171
• 
  Jun Guo, Kaishun Wang: Pooling designs with surprisingly high degree of error correction in a finite vector space. 2172-2176
• 
  Ivan Gutman, Stephan G. Wagner: The matching energy of a graph. 2177-2187
• 
  Sihuang Hu, Gennian Ge: Necessary conditions and frame constructions for Z-cyclic patterned starter whist tournaments. 2188-2198
• 
  Takehiro Ito, Marcin Kaminski, Erik D. Demaine: Reconfiguration of list edge-colorings in a graph. 2199-2207
• 
  Aubin Jarry: Multiflows in symmetric digraphs. 2208-2220
• 
  Mark-Christoph Körner, Horst Martini, Anita Schöbel: Minsum hyperspheres in normed spaces. 2221-2233
• 
  Martin Knor, Primoz Potocnik, Riste Skrekovski: The Wiener index in iterated line graphs. 2234-2245
• 
  Vladimir Kolmogorov: Minimizing a sum of submodular functions. 2246-2258
• 
  Christian Komusiewicz, Johannes Uhlmann: Cluster editing with locally bounded modifications. 2259-2270
• 
  Bo-Jr Li, Gerard J. Chang: Competition numbers of complete r-partite graphs. 2271-2276
• 
  Bodo Manthey: Deterministic algorithms for multi-criteria Max-TSP. 2277-2285
• 
  Boram Park, Suh-Ryung Kim: On Opsut's conjecture for hypercompetition numbers of hypergraphs. 2286-2293
• 
  Justo Puerto, Federica Ricca, Andrea Scozzari: Range minimization problems in path-facility location on trees. 2294-2305
• 
  Jelena Sedlar: The global forcing number of the parallelogram polyhex. 2306-2313

Note

• 
  Emeric Deutsch: Rooted tree statistics from Matula numbers. 2314-2322

Communication

• 
  Gregory Gutin, Anders Yeo: Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width. 2323-2328

Volume 160, Numbers 16-17, November 2012

Special Section: Boolean and Pseudo-Boolean Functions

• 
  Martin Anthony, Joel Ratsaby: Analysis of a multi-category classifier. 2329-2338
• 
  Cui Guo, Hong Seo Ryoo: Compact MILP models for optimal and Pareto-optimal LAD patterns. 2339-2348
• 
  Andreas Wotzlaw, Ewald Speckenmeyer, Stefan Porschen: Generalized k-ary tanglegrams on level graphs: A satisfiability-based approach and its evaluation. 2349-2363

Contributions

• 
  Manu Basavaraju, L. Sunil Chandran, T. Karthick: Maximum weight independent sets in hole- and dart-free graphs. 2364-2369
• 
  Alessandro Condotta, Natalia V. Shakhlevich: Scheduling coupled-operation jobs with exact time-lags. 2370-2388
• 
  Julien Darlay, Nadia Brauner, Julien Moncel: Dense and sparse graph partition. 2389-2396
• 
  Jin-Kao Hao, Qinghua Wu: Improving the extraction and expansion method for large graph coloring. 2397-2407
• 
  Fu-Tao Hu, You Lu, Jun-Ming Xu: The total bondage number of grid graphs. 2408-2418
• 
  Fredrik Kahl, Petter Strandmark: Generalized roof duality. 2419-2434
• 
  Ross J. Kang, Putra Manggala: Distance edge-colourings and matchings. 2435-2439
• 
  Dong Chan Kim, Jong Yoon Hyun: A Riemann hypothesis analogue for near-MDS codes. 2440-2444
• 
  Ping Li, Hong-Jian Lai, Yanting Liang: Characterization of removable elements with respect to having k disjoint bases in a matroid. 2445-2451
• 
  Wensong Lin, Pu Zhang: On n-fold L(j, k)-and circular L(j, k)-labelings of graphs. 2452-2461
• 
  Mostafa Nouri, Mohammad Ghodsi: Scheduling tasks with exponential duration on unrelated parallel machines. 2462-2473
• 
  Guanglong Yu, Hailiang Zhang, Huiqiu Lin, Yarong Wu, Jinlong Shu: Distance spectral spread of a graph. 2474-2478

Notes

• 
  Michel Mollard: Maximal hypercubes in Fibonacci and Lucas cubes. 2479-2483
• 
  Marcin Pilipczuk, Michal Pilipczuk, Riste Skrekovski: Some results on Vizing's conjecture and related problems. 2484-2490
• 
  Xinhong Zhang, Ruijuan Li, Shengjia Li: H-force sets of locally semicomplete digraphs. 2491-2496

Volume 160, Number 18, December 2012

• 
  Carlos Eduardo Ferreira, Fábio Protti, Jayme Luiz Szwarcfiter: V Latin-American Algorithms, Graphs, and Optimization Symposium - Gramado, Brazil, 2009. 2499-2501
• 
  Júlio Araújo, Nathann Cohen, Frédéric Giroire, Frédéric Havet: Good edge-labelling of graphs. 2502-2513
• 
  Júlio Araújo, Cláudia Linhares Sales: On the Grundy number of graphs with few P₄'s. 2514-2522
• 
  Laura Bahiense, Gordana Manic, Breno Piva, Cid C. de Souza: The maximum common edge subgraph problem: A polyhedral investigation. 2523-2541
• 
  Cyril Banderier, Pawel Hitczenko: Enumeration and asymptotics of restricted compositions having the same number of parts. 2542-2554
• 
  Silvia M. Bianchi, Mariana S. Escalante, M. Susana Montelar: Lift-and-project ranks of the set covering polytope of circulant matrices. 2555-2562
• 
  Olivier Bodini, Olivier Roussel, Michèle Soria: Boltzmann samplers for first-order differential specifications. 2563-2572
• 
  Flavia Bonomo, Javier Marenco, Daniela Sabán, Nicolás E. Stier Moses: A polyhedral study of the maximum edge subgraph problem. 2573-2590
• 
  Ralf Borndörfer, Marika Karbstein, Marc E. Pfetsch: Models for fare planning in public transport. 2591-2605
• 
  Mónica Braga, Diego Delle Donne, Javier Marenco: A polyhedral study of the acyclic coloring problem. 2606-2617
• 
  José Cáceres, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas: On the metric dimension of infinite graphs. 2618-2626
• 
  Pablo De Caria, Marisa Gutierrez: On minimal vertex separators of dually chordal graphs: Properties and characterizations. 2627-2635
• 
  Carlos Cardonha, Ralf Borndörfer: A set partitioning approach to shunting. 2636-2644
• 
  Domingos M. Cardoso, Enide Andrade Martins, María Robbiano, Vilmar Trevisan: Computing the Laplacian spectra of some graphs. 2645-2654
• 
  Márcia R. Cerioli, Daniel F. D. Posner: On L(2, 1)-coloring split, chordal bipartite, and weakly chordal graphs. 2655-2661
• 
  Simone Dantas, Frédéric Maffray, Ana Silva: 2k₂-partition of some classes of graphs. 2662-2668
• 
  Gabriele Di Stefano: Distance-hereditary comparability graphs. 2669-2680
• 
  Celina M. Herrera de Figueiredo: The P versus NP-complete dichotomy of some challenging problems in graph theory. 2681-2693
• 
  Ana Paulina Figueroa, Eduardo Rivera-Campo: The basis graph of a bicolored matroid. 2694-2697
• 
  Marina Groshaus, Pavol Hell, Juraj Stacho: On edge-sets of bicliques in graphs. 2698-2708
• 
  Frédéric Havet, Cláudia Linhares Sales, Leonardo Sampaio: b-coloring of tight graphs. 2709-2715
• 
  Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio: A note on permutation regularity. 2716-2727
• 
  Edna Ayako Hoshino, Cid C. de Souza: A branch-and-cut-and-price approach for the capacitated m-ring-star problem. 2728-2741
• 
  Robert E. Jamison: Towards a comprehensive theory of conflict-tolerance graphs. 2742-2751
• 
  Benjamin Lévêque, Dominique de Werra: Graph transformations preserving the stability number. 2752-2759
• 
  Ján Manuch, Murray Patterson, Cedric Chauve: Hardness results on the gapped consecutive-ones property problem. 2760-2768
• 
  Vagner Pedrotti, Célia Picinin de Mello: Minimal separators in extended P₄-laden graphs. 2769-2777
• 
  Indra Rajasingh, Paul Manuel, Bharati Rajan, Micheal Arockiaraj: Wirelength of hypercubes into certain trees. 2778-2786