Discrete Applied Mathematics, Volume 161

Volume 161, Numbers 1-2, January 2013

Special Section: Boolean and Pseudo-Boolean Functions

• 
  Julio Aracena, Luis Gómez, Lilian Salinas:
  Limit cycles and update digraphs in Boolean networks. 1-12
• 
  Pentti Haukkanen, Jorma K. Merikoski:
  Asymptotics of the number of threshold functions on a two-dimensional rectangular grid. 13-18
• 
  Lisa Hellerstein, Devorah Kletenik:
  On the gap between ess(f) and cnf_size(f). 19-27

Contributions

• 
  Igor Averbakh, Mehmet Baysan:
  Batching and delivery in semi-online distribution systems. 28-42
• 
  Sergey V. Avgustinovich, Sergey Kitaev, Alexandr Valyuzhenich:
  Avoidance of boxed mesh patterns on permutations. 43-51
• 
  Camino Balbuena, Xavier Marcote:
  The k-restricted edge-connectivity of a product of graphs. 52-59
• 
  Manoel B. Campêlo, Ricardo C. Corrêa, Phablo F. S. Moura, Marcio Costa Santos:
  On optimal k-fold colorings of webs and antiwebs. 60-70
• 
  Zhongyuan Che, Zhibo Chen:
  Forcing faces in plane bipartite graphs (II). 71-80
• 
  Mahdi Cheraghchi:
  Noise-resilient group testing: Limitations and constructions. 81-95
• 
  Alberto Costa, Pierre Hansen, Leo Liberti:
  On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square. 96-106
• 
  Éva Czabarka, Péter L. Erdös, Virginia Johnson, Vincent Moulton:
  Generating functions for multi-labeled trees. 107-117
• 
  Aiping Deng, Alexander K. Kelmans, Juan Meng:
  Laplacian spectra of regular graph transformations. 118-133
• 
  Zhibin Du:
  An edge grafting theorem on the Estrada index of graphs and its applications. 134-139
• 
  Petr A. Golovach, Daniël Paulusma, Jian Song:
  4-coloring H-free graphs when H is small. 140-150
• 
  Alain Goupil, Hugo Cloutier, Marie-Eve Pellerin:
  Generating functions for inscribed polyominoes. 151-166
• 
  Santosh N. Kabadi, Abraham P. Punnen:
  Spanning cactus of a graph: Existence, extension, optimization, and approximation. 167-175
• 
  Evangelos Kranakis, Oscar Morales-Ponce, Ladislav Stacho:
  Strongly connected orientations of plane graphs. 176-183
• 
  Julien Lesca, Michel Minoux, Patrice Perny:
  Compact versus noncompact LP formulations for minimizing convex Choquet integrals. 184-199
• 
  Xiangwen Li, Sanming Zhou:
  Labeling outerplanar graphs with maximum degree three. 200-211
• 
  Meili Liang, Bolian Liu:
  On the Randić index and girth of graphs. 212-216
• 
  Patrick Niesink, Keven Poulin, Mateja Sajna:
  Computing transitive closure of bipolar weighted digraphs. 217-243
• 
  Jeffrey Pattillo, Alexander Veremyev, Sergiy Butenko, Vladimir Boginski:
  On the maximum quasi-clique problem. 244-257
• 
  Guillaume Sagnol:
  Approximation of a maximum-submodular-coverage problem involving spectral functions, with application to experimental designs. 258-276
• 
  Guifu Su, Liming Xiong, Lan Xu:
  On the Co-PI and Laplacian Co-PI eigenvalues of a graph. 277-283
• 
  Ismael González Yero, Juan Alberto Rodríguez-Velázquez:
  Computing global offensive alliances in Cartesian product graphs. 284-293

Notes

• 
  Jordan R. Bell:
  Cyclotomic orthomorphisms of finite fields. 294-300
• 
  Ohad N. Feldheim, Rani Hod:
  3/2 firefighters are not enough. 301-306
• 
  Yingqian Wang, Lingji Xu:
  A sufficient condition for a plane graph with maximum degree 6 to be class 1. 307-310

Communication

• 
  Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot:
  House of Graphs: A database of interesting graphs. 311-314

Book Announcement

• 
  Yves Crama, Peter L. Hammer:
  Boolean Functions. 315

Volume 161, Number 3, February 2013

Contributions

• 
  Therese Biedl, Stephane Durocher, Céline Engelbeen, Samuel Fiorini, Maxwell Young:
  Faster optimal algorithms for segment minimization with small maximal value. 317-329
• 
  C. N. Campos, Yoshiko Wakabayashi:
  On dominating sets of maximal outerplanar graphs. 330-335
• 
  Maw-Shang Chang, Ling-Ju Hung, Peter Rossmanith:
  Recognition of probe distance-hereditary graphs. 336-348
• 
  Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning:
  Relating the annihilation number and the total domination number of a tree. 349-354
• 
  Guoli Ding, Cheng Liu:
  Excluding a small minor. 355-368
• 
  Keith J. Edwards:
  Harmonious chromatic number of directed graphs. 369-376
• 
  Evgeny Gurevsky, Olga Battaïa, Alexandre Dolgui:
  Stability measure for a generalized assembly line balancing problem. 377-394
• 
  Zana Kovijanic Vukicevic, Dragan Stevanovic:
  Bicyclic graphs with extremal values of PI index. 395-403
• 
  Jun Yuan, Aixia Liu, Hongmei Wu, Jing Li:
  Panconnectivity of n-dimensional torus networks with faulty vertices and edges. 404-423

Notes

• 
  Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen:
  The maximum number of minimal codewords in long codes. 424-429
• 
  Vladimir Kats, Eugene Levner:
  A note on periodic schedules for linear precedence constraints. 430-434
• 
  Jaromy Kuhl:
  Transversals and competition numbers of complete multipartite graphs. 435-440
• 
  Lifeng Ou, Heping Zhang:
  Fibonacci (p, r)-cubes which are median graphs. 441-444
• 
  Li Shang, Heping Zhang:
  Super restricted edge-connectivity of graphs with diameter 2. 445-451

Volume 161, Numbers 4-5, March 2013

• 
  Marc Demange, Vadim V. Lozin, Christophe Picouleau, Bernard Ries:
  GO VII Meeting, Ovronnaz (CH), June 13-17, 2010. 453
• 
  Shoshana Anily, Aharona Pfeffer:
  The uncapacitated swapping problem on a line and on a circle. 454-465
• 
  Mustapha Aouchiche, Pierre Hansen:
  A survey of Nordhaus-Gaddum type relations. 466-546
• 
  Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza:
  Optimal solutions for routing problems with profits. 547-557
• 
  Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos:
  Fast algorithms for min independent dominating set. 558-572
• 
  Gunnar Brinkmann, Simon Crevals, John Frye:
  An independent set approach for the communication network of the GPS III system. 573-579
• 
  Roberto Cordone, Guglielmo Lulli:
  An integer optimization approach for reverse engineering of gene regulatory networks. 580-592
• 
  Epameinondas Fritzilas, Martin Milanic, Jérôme Monnot, Yasmín Á. Ríos-Solís:
  Resilience and optimization of identifiable bipartite graphs. 593-603
• 
  Andrei Gagarin, Anush Poghosyan, Vadim E. Zverovich:
  Randomized algorithms and upper bounds for multiple domination in graphs and networks. 604-611
• 
  Sylvain Gravier, Anne Lacroix, Souad Slimani:
  (a, b)-codes in Z/nZ. 612-617
• 
  Mohamed Haouari, Safa Bhar Layeb, Hanif D. Sherali:
  Tight compact models and comparative analysis for the prize collecting Steiner tree problem. 618-632
• 
  Chính T. Hoàng, Marcin Kaminski, Joe Sawada, R. Sritharan:
  Finding and listing induced paths and cycles. 633-641
• 
  Antonio J. Lozano, Juan A. Mesa, Frank Plastria:
  The ordered anti-median problem with distances derived from a strictly convex norm. 642-649
• 
  Frédéric Maffray, Ana Silva:
  b-colouring the Cartesian product of trees and some other graphs. 650-669
• 
  Monaldo Mastrolilli, Arash Rafiey:
  On the approximation of minimum cost homomorphism to bipartite graphs. 670-676
• 
  Martin Milanic, Alexandru I. Tomescu:
  Set graphs. I. Hereditarily finite sets and extensional acyclic orientations. 677-690
• 
  I. M. Monroy, Ciro-Alberto Amaya, André Langevin:
  The periodic capacitated arc routing problem with irregular services. 691-701
• 
  Ingo Schiermeyer:
  On minimally rainbow k-connected graphs. 702-705

Volume 161, Number 6, April 2013

Special Section: Boolean and Pseudo-Boolean Functions

• 
  Kira V. Adaricheva, James B. Nation, Robert Rand:
  Ordered direct implicational basis of a finite closure system. 707-723

Contributions

• 
  Eric Ould Dadah Andriantiana:
  Energy, Hosoya index and Merrifield-Simmons index of trees with prescribed degree sequence. 724-741
• 
  Mikhail A. Babin, Sergei O. Kuznetsov:
  Computing premises of a minimal cover of functional dependencies is intractable. 742-749
• 
  Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro:
  On the approximability and exact algorithms for vector domination and related problems in graphs. 750-767
• 
  Cristina Dalfó, Miguel Angel Fiol, Ernest Garriga:
  Moments in graphs. 768-777
• 
  Benjamin Doerr, Anna Huber, Ariel Levavi:
  Strong robustness of randomized rumor spreading protocols. 778-793
• 
  Fengming Dong, Weigen Yan, Fuji Zhang:
  On the number of perfect matchings of line graphs. 794-801
• 
  Min Feng, Min Xu, Kaishun Wang:
  On the metric dimension of line graphs. 802-805
• 
  Shinya Fujita, Michitaka Furuya:
  Difference between 2-rainbow domination and Roman domination in graphs. 806-812
• 
  Dániel Gerbner, Gyula O. H. Katona, Dömötör Pálvölgyi, Balázs Patkós:
  Majority and plurality problems. 813-818
• 
  Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot:
  Complexity of trails, paths and circuits in arc-colored digraphs. 819-828
• 
  Ernst J. Joubert:
  Maximum sizes of graphs with given restrained domination numbers. 829-837
• 
  Henry Martyn Mulder, Beth Novick:
  A tight axiomatization of the median procedure on median graphs. 838-846

Notes

• 
  Eric Angel, Romain Campigotto, Christian Laforest:
  A new lower bound on the independence number of graphs. 847-852
• 
  Camino Balbuena, Diego González-Moreno, Juan José Montellano-Ballesteros:
  A note on the upper bound and girth pair of (k;g)-cages. 853-857
• 
  Byung-Cheon Choi, Jibok Chung:
  Job release scheduling problem: Complexity and an approximation algorithm. 858-863
• 
  Michael Ferrara, Ellen Gethner, Stephen G. Hartke, Derrick Stolee, Paul S. Wenger:
  List distinguishing parameters of trees. 864-869

Volume 161, Numbers 7-8, May 2013

Special Section: Computational Biology

• 
  Peter J. Humphries, Simone Linz, Charles Semple:
  On the complexity of computing the temporal hybridization number for two phylogenies. 871-880

Contributions

• 
  Sarah Spence Adams, Noura Howell, Nathaniel J. Karst, Denise Sakai Troxell, Junjie Zhu:
  On the L(2, 1)-labelings of amalgamations of graphs. 881-888
• 
  Jørgen Bang-Jensen, Alessandro Maddaloni, Sven Simonsen:
  Quasi-hamiltonian paths in semicomplete multipartite digraphs. 889-898
• 
  Cristina Bazgan, Morgan Chopin, Bernard Ries:
  The firefighter problem with more than one firefighter on trees. 899-908
• 
  Nadia Brauner, Sylvain Gravier, Louis-Philippe Kronek, Frédéric Meunier:
  LAD models, trees, and an analog of the fundamental theorem of arithmetic. 909-920
• 
  Min Chen, André Raspaud:
  Planar graphs without 4- and 5-cycles are acyclically 4-choosable. 921-931
• 
  An-Chiang Chu, Bang Ye Wu, Kun-Mao Chao:
  A linear-time algorithm for finding an edge-partition with max-min ratio at most two. 932-943
• 
  Italo J. Dejter:
  Worst-case efficient dominating sets in digraphs. 944-952
• 
  Tomica Divnic, Ljiljana Pavlovic:
  Proof of the first part of the conjecture of Aouchiche and Hansen about the Randić index. 953-960
• 
  Peter Eades, Giuseppe Liotta:
  Right angle crossing graphs and 1-planarity. 961-969
• 
  Andreas Emil Feldmann, Shantanu Das, Peter Widmayer:
  Corner cuts are close to optimal: From solid grids to polygons and back. 970-998
• 
  Ze-Tu Gao, Jian-Hua Yin:
  On the t-pebbling number and the 2t-pebbling property of graphs. 999-1005
• 
  Marc Hellmuth:
  On the complexity of recognizing S-composite and S-prime graphs. 1006-1013
• 
  Mokhtar H. Konsowa, Fahimah Al-Awadhi, András Telcs:
  Commute times of random walks on trees. 1014-1021
• 
  Dorota Kuziak, Ismael González Yero, Juan Alberto Rodríguez-Velázquez:
  On the strong metric dimension of corona product graphs and join graphs. 1022-1027
• 
  Van Bang Le, Dieter Rautenbach:
  Integral mixed unit interval graphs. 1028-1036
• 
  Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
  Normal Helly circular-arc graphs and its subclasses. 1037-1059
• 
  Wu-Hsiung Lin, Gerard J. Chang:
  b-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture. 1060-1066
• 
  Yo-Lin Lin, Justie Su-tzu Juan, Yue-Li Wang:
  Finding the edge ranking number through vertex partitions. 1067-1071
• 
  Carles Padró, Leonor Vázquez, An Yang:
  Finding lower bounds on the complexity of secret sharing schemes by linear programming. 1072-1084
• 
  B. S. Panda, Subhabrata Paul:
  Liar's domination in graphs: Complexity and algorithm. 1085-1092
• 
  Jung-Heum Park, Insung Ihm:
  Strong matching preclusion under the conditional fault model. 1093-1105
• 
  Adrien Richard, Paul Ruet:
  From kernels in directed graphs to fixed points and negative cycles in Boolean networks. 1106-1117
• 
  Jian-Hua Yin:
  An extension of A.R. Rao's characterization of potentially K_m+1-graphic sequences. 1118-1127
• 
  Carol T. Zamfirescu:
  (2)-pancyclic graphs. 1128-1136

Notes

• 
  Frantisek Galcík, Ján Katrenic:
  A note on approximating the b-chromatic number. 1137-1140
• 
  Sugata Gangopadhyay:
  Affine inequivalence of cubic Maiorana-McFarland type bent functions. 1141-1146
• 
  Bill Jackson, Tibor Jordán, Csaba Király:
  Strongly rigid tensegrity graphs on the line. 1147-1149
• 
  Sandi Klavzar, Mohammad J. Nadjafi-Arani:
  Wiener index versus Szeged index in networks. 1150-1153
• 
  Lukasz Kowalik, Marcin Pilipczuk, Karol Suchan:
  Towards optimal kernel for connected vertex cover in planar graphs. 1154-1161
• 
  Mostafa Tavakoli, Freydoon Rahbarnia, A. R. Ashrafi:
  Further results on hierarchical product of graphs. 1162-1167

Volume 161, Number 9, June 2013

• 
  Daniel J. Kleitman, Aditya Shastri, Vera T. Sós:
  Editorial. 1169
• 
  Mukti Acharya, Deepa Sinha:
  Characterization of signed line digraphs. 1170-1172
• 
  Rangaswami Balakrishnan, S. Francis Raj:
  Bounds for the b-chromatic number of G-v. 1173-1179
• 
  Amitava Bhattacharya, Navin M. Singhi:
  Some approaches for solving the general (t, k)-design existence problem and other related problems. 1180-1186
• 
  T. Tamizh Chelvam, Sivagnanam Mutharasu:
  Subgroups as efficient dominating sets in Cayley graphs. 1187-1190
• 
  David Conlon, Jacob Fox, Benny Sudakov:
  An improved bound for the stepping-up lemma. 1191-1196
• 
  Andrzej Dudek, Peter Frankl, Vojtech Rödl:
  Some recent results on Ramsey-type numbers. 1197-1202
• 
  Dwight Duffus, Peter Frankl, Vojtech Rödl:
  Maximal independent sets in the covering graph of the cube. 1203-1208
• 
  Subir Kumar Ghosh, Penny E. Haxell:
  Packing and covering tetrahedra. 1209-1215
• 
  Shan-Yuan Ho, Daniel J. Kleitman:
  An odd kind of BCH code. 1216-1220
• 
  Glenn Hurlbert:
  General graph pebbling. 1221-1231
• 
  Oliver Johnson, Ioannis Kontoyiannis, Mokshay M. Madiman:
  Log-concavity, ultra-log-concavity, and a maximum entropy property of discrete compound Poisson measures. 1232-1250
• 
  Gyula O. H. Katona:
  Sperner type theorems with excluded subposets. 1251-1258
• 
  János Pach, Géza Tóth:
  Monochromatic empty triangles in two-colored point sets. 1259-1261
• 
  Deepa Sinha, Jaspreet Kaur:
  Full friendly index set - I. 1262-1274
• 
  Deepa Sinha, Somya Upadhyaya, Priya Kataria:
  Characterization of common-edge sigraph. 1275-1285

Volume 161, Numbers 10-11, July 2013

Perspective

• 
  Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
  Simple agents learn to find their way: An introduction on mapping polygons. 1287-1307

Special Section - Game Theory

• 
  Bostjan Bresar, Sandi Klavzar, Gasper Kosmrlj, Douglas F. Rall:
  Domination game: Extremal families of graphs for 3/53/5-conjectures. 1308-1316
• 
  Oliver Friedmann:
  A superpolynomial lower bound for strategy iteration based on snare memorization. 1317-1337
• 
  Lucy Small, Oliver Mason:
  Information diffusion on the iterated local transitivity model of online social networks. 1338-1344

Contributions

• 
  Julio Aracena, Jacques Demongeot, Eric Fanchon, Marco Montalva:
  On the number of update digraphs and its relation with the feedback arc sets and tournaments. 1345-1355
• 
  Danilo Artigas, Simone Dantas, Mitre Costa Dourado, Jayme Luiz Szwarcfiter, Sei-ichi Yamaguchi:
  On the contour of graphs. 1356-1362
• 
  Maria Axenovich, Marcus Krug, Georg Osang, Ignaz Rutter:
  Fork-forests in bi-colored complete bipartite graphs. 1363-1366
• 
  Yuehua Bu, Kai Lu:
  List injective coloring of planar graphs with girth 5, 6, 8. 1367-1377
• 
  Jonathan Burns, Egor Dolzhenko, Natasa Jonoska, Tilahun Muche, Masahico Saito:
  Four-regular graphs with rigid vertices associated to DNA recombination. 1378-1394
• 
  Gerard J. Chang, Bo-Jr Li, Jiaojiao Wu:
  Rainbow domination and related problems on strongly chordal graphs. 1395-1401
• 
  Stefan Dobrev, Rastislav Královic, Dana Pardubská, L'ubomír Török, Imrich Vrt'o:
  Antibandwidth and cyclic antibandwidth of Hamming graphs. 1402-1408
• 
  Andreas W. M. Dress, Vincent Moulton, Andreas Spillner, Taoyang Wu:
  Obtaining splits from cut sets of tight spans. 1409-1420
• 
  Tomás Feder, Carlos S. Subi:
  On hypercube labellings and antipodal monochromatic paths. 1421-1426
• 
  Martín Eduardo Frías-Armenta, Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña:
  Edge contraction and edge removal on iterated clique graphs. 1427-1439
• 
  Delia Garijo, Antonio González Herrera, Alberto Márquez:
  On the metric dimension, the upper dimension and the resolving number of graphs. 1440-1447
• 
  Simona Grusea, Anthony Labarre:
  The distribution of cycles in breakpoint graphs of signed permutations. 1448-1466
• 
  Steffen Grüter, Yubao Guo, Andreas Holtkamp, Eduard Ulmer:
  Restricted arc-connectivity in tournaments. 1467-1471
• 
  Adriana Hansberg, Ryan Pepper:
  On kk-domination and jj-independence in graphs. 1472-1480
• 
  Xiaolan Hu, Huiqing Liu:
  The (conditional) matching preclusion for burnt pancake graphs. 1481-1489
• 
  Vinayak Joshi, B. N. Waphare, H. Y. Pourali:
  On generalized zero divisor graph of a poset. 1490-1495
• 
  Arindam Khan, Sudebkumar Prasant Pal, Mridul Aanjaneya, Arijit Bishnu, Subhas C. Nandy:
  Diffuse reflection diameter and radius for convex-quadrilateralizable polygons. 1496-1505
• 
  Jakub Kovác:
  Complexity of the path avoiding forbidden pairs problem revisited. 1506-1512
• 
  James K. Lan, Gerard Jennhwa Chang:
  Algorithmic aspects of the kk-domination problem in graphs. 1513-1520
• 
  Timothy D. LeSaulnier, Douglas B. West:
  Acquisition-extremal graphs. 1521-1529
• 
  Mingchu Li:
  Hamiltonian claw-free graphs involving minimum degrees. 1530-1537
• 
  Martin Milanic, Oliver Schaudt:
  Computing square roots of trivially perfect and threshold graphs. 1538-1545
• 
  Esther Mohr, Günter Schmidt:
  How much is it worth to know the future in online conversion problems? 1546-1555
• 
  Atsuyoshi Nakamura, Tomoya Saito, Ichigaku Takigawa, Mineichi Kudo, Hiroshi Mamitsuka:
  Fast algorithms for finding a minimum repetition representation of strings and trees. 1556-1575
• 
  Micha A. Perles, Horst Martini, Yaakov S. Kupitz:
  On the polygonal diameter (= link diameter) of the interior, resp. exterior, of a simple closed polygon in the plane. 1576-1585
• 
  Alain Quilliot, Philippe Chrétienne:
  Homogeneously non-idling schedules of unit-time jobs on identical parallel machines. 1586-1597
• 
  Pascal Schweitzer:
  Iterated open neighborhood graphs and generalizations. 1598-1609
• 
  Jianfeng Wang, Francesco Belardo:
  Signless Laplacian eigenvalues and circumference of graphs. 1610-1617
• 
  Ismael González Yero, Juan Alberto Rodríguez-Velázquez, Sergio Bermudo:
  Alliance free sets in Cartesian product graphs. 1618-1625

Notes

• 
  Yong Gao, Donovan R. Hare, James Nastos:
  The parametric complexity of graph diameter augmentation. 1626-1631
• 
  Stefan Gyürki, Ján Mazák:
  An efficient algorithm for testing goal-minimality of graphs. 1632-1634
• 
  Vadim E. Levit, Eugen Mandrescu:
  On maximum matchings in König-Egerváry graphs. 1635-1638
• 
  Susana-Clara López:
  Small cutsets in arc-transitive digraphs of prime degree. 1639-1645
• 
  Robert C. Powers, Jeremy M. White:
  Injectivity and weak ternary separation. 1646-1650
• 
  Le Anh Vinh:
  An explicit construction of (3, t)(3, t)-existentially closed graphs. 1651-1654
• 
  Wei Wang, Zhidan Yan:
  Connectivity of Kronecker products with complete multipartite graphs. 1655-1659
• 
  Yan Wang, Chunxiang Wang:
  On 4-γ_tγt-critical graphs of diameter two. 1660-1668

Communication

• 
  László Major:
  Unimodality and log-concavity of ff-vectors for cyclic and ordinary polytopes. 1669-1672

Volume 161, Number 12, August 2013

• 
  Ulrich Faigle, Rainer Schrader:
  9th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010). 1673
• 
  David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein:
  Watching systems in graphs: An extension of identifying codes. 1674-1685
• 
  Daniel Binkele-Raible, Henning Fernau:
  Packing paths: Recycling saves time. 1686-1698
• 
  Matthijs Bomhoff, Bodo Manthey:
  Bisimplicial edges in bipartite graphs. 1699-1706
• 
  Valentina Cacchiani, Alberto Caprara, Paolo Toth:
  A Lagrangian heuristic for a train-unit assignment problem. 1707-1718
• 
  Tiziana Calamoneri, Blerina Sinaimeri:
  L(2, 1)L(2, 1)-labeling of oriented planar graphs. 1719-1725
• 
  Rija Erves, Janez Zerovnik:
  Mixed fault diameter of Cartesian graph bundles. 1726-1733
• 
  Frank Göring, Jochen Harant:
  Prescribed edges and forbidden edges for a cycle in a planar graph. 1734-1738
• 
  Ararat Harutyunyan:
  Some bounds on global alliances in trees. 1739-1746
• 
  Shahadat Hossain, Trond Steihaug:
  Graph models and their efficient implementation for sparse Jacobian matrix determination. 1747-1754
• 
  Suh-Ryung Kim, Boram Park, Yoshio Sano:
  The competition number of the complement of a cycle. 1755-1760
• 
  Bodo Manthey, Kai Plociennik:
  Approximating independent set in perturbed graphs. 1761-1768
• 
  Jens Maßberg, Tim Nieberg:
  Rectilinear paths with minimum segment lengths. 1769-1775
• 
  B. S. Panda, Dinabandhu Pradhan:
  A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph. 1776-1783
• 
  Ingo Schiermeyer:
  Rainbow connection and minimum degree. 1784-1787

Volume 161, Numbers 13-14, September 2013

Special Section: Computational Biology

• 
  Daniele Catanzaro, Martine Labbé, Raffaele Pesenti:
  The balanced minimum evolution problem under uncertain data. 1789-1804
• 
  Daniel M. Martin, Bhalchandra D. Thatte:
  The maximum agreement subtree problem. 1805-1817
• 
  Adam Kozak, Tomasz Glowacki, Piotr Formanowicz:
  On a generalized model of labeled graphs. 1818-1827

Special Section: Game Theory

• 
  Daniel W. Cranston, William B. Kinnersley, Suil O, Douglas B. West:
  Game matching number of graphs. 1828-1836
• 
  Vladimir G. Deineko, Gerhard J. Woeginger:
  Two hardness results for core stability in hedonic coalition formation games. 1837-1842
• 
  Leah Epstein, Michal Feldman, Tami Tamir, Lukasz Witkowski, Marcin Witkowski:
  Approximate strong equilibria in job scheduling games with two uniformly related machines. 1843-1858

Contributions

• 
  S. Arumugam, Bibin K. Jose, Csilla Bujtás, Zsolt Tuza:
  Equality of domination and transversal numbers in hypergraphs. 1859-1867
• 
  Peter R. J. Asveld:
  Permuting operations on strings and the distribution of their prime numbers. 1868-1881
• 
  Alan F. Beardon:
  Resolving the hypercube. 1882-1887
• 
  Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
  Characterizing graphs of small carving-width. 1888-1893
• 
  Radim Belohlávek, Vilém Vychodil:
  Closure-based constraints in formal concept analysis. 1894-1911
• 
  Asen Bojilov, Yair Caro, Adriana Hansberg, Nedyalko Nenov:
  Partitions of graphs into small and large sets. 1912-1924
• 
  Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler:
  On minimal forbidden subgraph characterizations of balanced graphs. 1925-1942
• 
  Bostjan Bresar, Marko Jakovac, Ján Katrenic, Gabriel Semanisin, Andrej Taranenko:
  On the vertex kk-path cover. 1943-1949
• 
  Dariusz Dereniowski, Öznur Yasar Diner, Danny Dyer:
  Three-fast-searchable graphs. 1950-1958
• 
  Paolo Dulio, Carla Peri:
  Discrete tomography for inscribable lattice sets. 1959-1974
• 
  Leah Epstein, Csanád Imreh, Asaf Levin:
  Bin covering with cardinality constraints. 1975-1987
• 
  Anna Galluccio, Claudio Gentile, Paolo Ventura:
  22-clique-bond of stable set polyhedra. 1988-2000
• 
  Mohammad Ghebleh, Ludovít Niepel:
  Locating and identifying codes in circulant networks. 2001-2007
• 
  Steffen Grüter, Yubao Guo, Andreas Holtkamp:
  Restricted arc-connectivity of bipartite tournaments. 2008-2013
• 
  Michael A. Henning, Ernst J. Joubert:
  Equality in a linear Vizing-like relation that relates the size and total domination number of a graph. 2014-2024
• 
  Florian Jaehn, Erwin Pesch:
  New bounds and constraint propagation techniques for the clique partitioning problem. 2025-2037
• 
  Hai-Tao Jin, Lisa Hui Sun:
  On Spieß's conjecture on harmonic numbers. 2038-2041
• 
  Ville Junnila:
  New lower bound for 2-identifying code in the square grid. 2042-2051
• 
  Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Pawel Rzazewski:
  Determining the L(2, 1)L(2, 1)-span in polynomial space. 2052-2061
• 
  Changhong Lu, Qing Zhou:
  Path covering number and L(2, 1)L(2, 1)-labeling number of graphs. 2062-2074
• 
  Hongliang Lu:
  Simplified existence theorems on all fractional [a, b][a, b]-factors. 2075-2078
• 
  Benjian Lv, Kaishun Wang:
  The energy of qq-Kneser graphs and attenuated qq-Kneser graphs. 2079-2083
• 
  Toufik Mansour, Mark Shattuck:
  A combinatorial approach to a general two-term recurrence. 2084-2094
• 
  Jana Maxová, Daniel Turzík:
  Which distance-hereditary graphs are cover-incomparability graphs? 2095-2100
• 
  Zeev Nutov:
  Small ℓℓ-edge-covers in kk-connected graphs. 2101-2106
• 
  Damien Prot, Christophe Rapine:
  Approximations for the Two-Machine Cross-Docking Flow Shop Problem. 2107-2119
• 
  Amites Sarkar, Martin Haenggi:
  Percolation in the secrecy graph. 2120-2132
• 
  Tadeja Kraner Sumenjak, Douglas F. Rall, Aleksandra Tepeh:
  Rainbow domination in the lexicographic product of graphs. 2133-2141
• 
  Anke van Zuylen:
  Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems. 2142-2157
• 
  Aleksander Vesel:
  Fibonacci dimension of the resonance graphs of catacondensed benzenoid graphs. 2158-2168
• 
  Lutz Volkmann:
  Complementary cycles in almost regular multipartite tournaments, where one cycle has length four. 2169-2177
• 
  Yue-Li Wang, Kuo-Hua Wu:
  A tight upper bound for 2-rainbow domination in generalized Petersen graphs. 2178-2188
• 
  Shou-Jun Xu, Xianyue Li, Ronghua Liang:
  Moplex orderings generated by the LexDFS algorithm. 2189-2195
• 
  Dong Ye:
  On the anti-Kekulé number and odd cycle transversal of regular graphs. 2196-2199

Notes

• 
  Guillaume Ducoffe:
  Hamiltonicity of large generalized de Bruijn cycles. 2200-2204
• 
  Kamran Kianfar, Ghasem Moslehi:
  A note on "Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date". 2205-2206
• 
  Seog-Jin Kim, Sangjune Lee, Won-Jin Park:
  Dynamic coloring and list dynamic coloring of planar graphs. 2207-2212
• 
  Toufik Mansour, Mark Shattuck:
  Counting humps and peaks in generalized Motzkin paths. 2213-2216
• 
  Simon Mukwembi:
  On spanning cycles, paths and trees. 2217-2222

Volume 161, Number 15, October 2013

• 
  Isabelle Debled-Rennesson, Eric Domenjoud, Bertrand Kerautret, Philippe Even:
  Discrete Geometry for Computer Imagery. 2223
• 
  Péter Balázs:
  Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections. 2224-2235
• 
  Kees Joost Batenburg, Wagner Fortes, Lajos Hajdu, Robert Tijdeman:
  Bounds on the quality of reconstructed images in binary tomography. 2236-2251
• 
  Étienne Baudrier, Mohamed Tajine, Alain Daurat:
  Polygonal estimation of planar convex-set perimeter from its two projections. 2252-2268
• 
  Jürgen Bokowski, Ernesto Staffetti:
  Checking oriented matroid isomorphism by means of canonical labeling. 2269-2280
• 
  Sara Brunetti, Paolo Dulio, Carla Peri:
  Discrete tomography determination of bounded lattice sets from four X-rays. 2281-2292
• 
  Jacques-Olivier Lachaud, Mouhammad Said:
  Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line. 2293-2315
• 
  Alexandre Blondin Massé, Andrea Frosini, Simone Rinaldi, Laurent Vuillon:
  On the shape of permutomino tiles. 2316-2327
• 
  K. G. Subramanian, Ibrahim Venkat, Erzsébet Csuhaj-Varjú:
  On the power of permitting features in cooperating context-free array grammar systems. 2328-2335
• 
  Peter Veelaert:
  Topological relations between separating circles. 2336-2347

Volume 161, Numbers 16-17, November 2013

Contributions

• 
  Bernardetta Addis, Marco Di Summa, Andrea Grosso:
  Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth. 2349-2360
• 
  Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono:
  Optimal approximability of bookmark assignments. 2361-2366
• 
  Teodor Banica, Ion Nechita:
  Almost Hadamard matrices: The case of arbitrary exponents. 2367-2379
• 
  Flavia Bonomo, Mitre Costa Dourado, Guillermo Durán, Luérbio Faria, Luciano N. Grippo, Martín Darío Safe:
  Forbidden subgraphs and the König-Egerváry property. 2380-2388
• 
  Michael Brand:
  Friedman numbers have density 1. 2389-2395
• 
  Kejun Chen, Guangzhou Chen, Wen Li, Ruizhong Wei:
  Super-simple balanced incomplete block designs with block size 5 and index 3. 2396-2404
• 
  Gek Ling Chia, Kai An Sim:
  On the skewness of the join of graphs. 2405-2409
• 
  Vítor Costa, Simone Dantas, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
  More fires and more fighters. 2410-2419
• 
  Michitaka Furuya:
  Upper bounds on the diameter of domination dot-critical graphs with given connectivity. 2420-2426
• 
  Xianya Geng, Shuchao Li, Meng Zhang:
  Extremal values on the eccentric distance sum of trees. 2427-2439
• 
  Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Vladimir V. Podolskii, Elias P. Tsigaridas:
  Patience of matrix games. 2440-2459
• 
  Michael A. Henning, Nader Jafari Rad:
  Bounds on neighborhood total domination in graphs. 2460-2466
• 
  Hervé Hocquard, Mickaël Montassier, André Raspaud, Petru Valicov:
  On strong edge-colouring of subcubic graphs. 2467-2479
• 
  Hongbo Hua, Kinkar Chandra Das:
  The relationship between the eccentric connectivity index and Zagreb indices. 2480-2491
• 
  W. Sean Kennedy, Andrew D. King:
  Finding a smallest odd hole in a claw-free graph using global structure. 2492-2498
• 
  George Kettleborough, Victor J. Rayward-Smith:
  Optimising sum-of-squares measures for clustering multisets defined over a metric space. 2499-2513
• 
  Sergey Kitaev, Pavel Salimov, Christopher Severs, Henning Úlfarsson:
  Restricted non-separable planar maps and some pattern avoiding permutations. 2514-2526
• 
  Xueliang Li, Mengmeng Liu:
  Bicyclic graphs with maximal revised Szeged index. 2527-2531
• 
  Wu-Hsiung Lin, Gerard J. Chang:
  bb-chromatic numbers of powers of paths and cycles. 2532-2536
• 
  Huiqiu Lin, Jinlong Shu:
  The distance spectral radius of digraphs. 2537-2543
• 
  Jianxi Liu:
  On a conjecture of the Randić index and the minimum degree of graphs. 2544-2548
• 
  Henry Liu, Ângela Mestre, Teresa Sousa:
  Rainbow vertex k-connection in graphs. 2549-2555
• 
  Jens Maßberg:
  Online binary minimax trees. 2556-2562
• 
  Marios Mavronicolas, Burkhard Monien, Vicky Papadopoulou Lesta:
  How many attackers can selfish defenders catch? 2563-2586
• 
  David Peleg, Ignasi Sau, Mordechai Shalom:
  On approximating the d-girth of a graph. 2587-2596
• 
  Mikko Pelto:
  Optimal (r, ≤3)-locating-dominating codes in the infinite king grid. 2597-2603
• 
  Frank Plastria, José Gordillo, Emilio Carrizosa:
  Locating a semi-obnoxious covering facility with repelling polygonal regions. 2604-2623
• 
  Justo Puerto, Ana Belén Ramos, Antonio M. Rodríguez-Chía:
  A specialized branch & bound & cut for Single-Allocation Ordered Median Hub Location problems. 2624-2646
• 
  Oliver Schaudt:
  On dominating sets whose induced subgraphs have a bounded diameter. 2647-2652
• 
  Apurv Tiwari, Amitabha Tripathi:
  On the range of size of sum graphs & integral sum graphs of a given order. 2653-2661
• 
  Jean-Luc Toutant, Eric Andres, Tristan Roussillon:
  Digital circles, spheres and hyperspheres: From morphological models to analytical characterizations and topological properties. 2662-2677
• 
  Damir Vukicevic, Gilles Caporossi:
  Network descriptors based on betweenness centrality and transmission and their extremal values. 2678-2686
• 
  Yiqiao Wang, Qiaojun Shu, Weifan Wang:
  The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle. 2687-2694
• 
  Iwona Wloch, Urszula Bednarz, Dorota Bród, Andrzej Wloch, Malgorzata Wolowiec-Musial:
  On a new type of distance Fibonacci numbers. 2695-2701
• 
  Yujun Yang, Douglas J. Klein:
  A recursion formula for resistance distances and its applications. 2702-2715
• 
  Manouchehr Zaker:
  Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs. 2716-2723

Notes

• 
  Jørgen Bang-Jensen, Sven Simonsen:
  Arc-disjoint paths and trees in 2-regular digraphs. 2724-2730
• 
  Monica Bianchi, Alessandra Cornaro, Anna Torriero:
  A majorization method for localizing graph topological indices. 2731-2739
• 
  Hanyuan Deng, Selvaraj Balachandran, S. K. Ayyaswamy, Yanamandram B. Venkatakrishnan:
  On the harmonic index and the chromatic number of a graph. 2740-2744
• 
  Jong Yoon Hyun, Heisook Lee, Yoonjin Lee:
  Nonexistence of certain types of plateaued functions. 2745-2748
• 
  Hongwei Li, Shengjia Li, Yubao Guo, Michel Surmacs:
  On the vertex-pancyclicity of hypertournaments. 2749-2752
• 
  Hao Li, Weihua Yang:
  Bounding the size of the subgraph induced by mm vertices and extra edge-connectivity of hypercubes. 2753-2757
• 
  Jakub Przybylo:
  On upper bounds for multiple domination numbers of graphs. 2758-2763
• 
  Julien Roland, Yves De Smet, José Rui Figueira:
  Inverse multi-objective combinatorial optimization. 2764-2771
• 
  Ian M. Wanless, Xiande Zhang:
  On the existence of retransmission permutation arrays. 2772-2777

Communication

• 
  Pietro Belotti, Julio Cesar Goez, Imre Pólik, Ted K. Ralphs, Tamás Terlaky:
  On families of quadratic surfaces having fixed intersections with two hyperplanes. 2778-2793

Volume 161, Number 18, December 2013

Contributions

• 
  Encarnación Abajo, Rocío M. Casablanca, Ana Diánez, Pedro García-Vázquez:
  On average connectivity of the strong product of graphs. 2795-2801
• 
  Patrick Ali, Simon Mukwembi, Sheunesu Munyira:
  Degree distance and vertex-connectivity. 2802-2811
• 
  Miguel F. Anjos, Manuel V. C. Vieira:
  Semidefinite resolution and exactness of semidefinite relaxations for satisfiability. 2812-2826
• 
  Mahdieh Azari, Ali Iranmanesh:
  Computing the eccentric-distance sum for graph operations. 2827-2840
• 
  Cristina Bazgan, Florian Jamain, Daniel Vanderpooten:
  On the number of non-dominated points of a multicriteria optimization problem. 2841-2850
• 
  Francine Blanchet-Sadri, Sean Simmons:
  Counting minimal semi-Sturmian words. 2851-2861
• 
  Nils Boysen, Konrad Stephan:
  The deterministic product location problem under a pick-by-order policy. 2862-2875
• 
  Roman Cada, Jan Ekstein, Premysl Holub, Olivier Togni:
  Radio labelings of distance graphs. 2876-2884
• 
  Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Alice A. McRae:
  [1, 2]-sets in graphs. 2885-2893
• 
  Dongqin Cheng, Rong-Xia Hao, Yan-Quan Feng:
  Cycles embedding on folded hypercubes with faulty nodes. 2894-2900
• 
  Alberto Costa:
  Valid constraints for the Point Packing in a Square problem. 2901-2909
• 
  Ari Cukierman, Gexin Yu:
  New bounds on the minimum density of an identifying code for the infinite hexagonal grid. 2910-2924
• 
  Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning:
  Bounds on the connected domination number of a graph. 2925-2931
• 
  Ewa Drgas-Burchardt, Zbigniew Switalski:
  A number of stable matchings in models of the Gale-Shapley type. 2932-2936
• 
  Fang-Wei Fu, San Ling, Chaoping Xing:
  New results on two hypercube coloring problems. 2937-2945
• 
  Daniel Gonçalves, Aline Parreau, Alexandre Pinlou:
  Locally identifying coloring in bounded expansion classes of graphs. 2946-2951
• 
  Elizabeth J. Hartung:
  Fullerenes with complete Clar structure. 2952-2957
• 
  Jianfeng Hou, Weitao Wang, Xiaoran Zhang:
  Acyclic edge coloring of planar graphs with girth at least 5. 2958-2967
• 
  Markus Kuba, Hosam M. Mahmoud, Alois Panholzer:
  Analysis of a generalized Friedman's urn with multiple drawings. 2968-2984
• 
  Hongyu Liang:
  On the k-edge-incident subgraph problem and its variants. 2985-2991
• 
  Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu, Tzu-Liang Kung:
  Disjoint cycles in hypercubes with prescribed vertices in each cycle. 2992-3004
• 
  Susana-Clara López, Francesc A. Muntaner-Batle, Miquel Rius-Font:
  Labeling constructions using digraph products. 3005-3016
• 
  Anh Ninh, András Prékopa:
  Log-concavity of compound distributions with applications in stochastic optimization. 3017-3027
• 
  Offer Shai, Adnan Sljoka, Walter Whiteley:
  Directed graphs, decompositions, and spatial linkages. 3028-3047
• 
  Ruixia Wang, Shiying Wang:
  A sufficient condition for graphs to be λ_k-optimal. 3048-3053
• 
  Shiying Wang, Kai Feng, Guozhen Zhang:
  Strong matching preclusion for k-ary n-cubes. 3054-3062
• 
  Weizhong Wang, Dong Yang, Yanfeng Luo:
  The Laplacian polynomial and Kirchhoff index of graphs derived from regular graphs. 3063-3071
• 
  Krasimir Yordzhev:
  On the number of disjoint pairs of S-permutation matrices. 3072-3079

Notes

• 
  Louis J. Billera, Saúl A. Blanco:
  Bandwidth of the product of paths of the same length. 3080-3086
• 
  Nader Jafari Rad, Lutz Volkmann:
  A note on the independent domination number in graphs. 3087-3089
• 
  Wojciech Kazmierczak:
  The best choice problem for a union of two linear orders with common maximum. 3090-3096
• 
  Shin-ichi Tokunaga:
  Dominating sets of maximal outerplanar graphs. 3097-3099
• 
  Zhifu You, Lihua You, Wenxi Hong:
  Comment on "Kirchhoff index in line, subdivision and total graphs of a regular graph". 3100-3103
• 
  Yuyin Yu, Mingsheng Wang:
  Permutation polynomials and their differential properties over residue class rings. 3104-3108