Journal: Discrete Mathematics & Theoretical Computer Science

Volume 16, Issue 3

1 -- 22Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler. Balancedness of subclasses of circular-arc graphs
23 -- 50Peng Li, Yaokun Wu. A Four-Sweep LBFS Recognition Algorithm for Interval Graphs
51 -- 60Xiaolong Huang, Hengzhe Li, Xueliang Li, Yuefang Sun. Oriented diameter and rainbow connection number of a graph
61 -- 76Peter Dukes, Steve Lowdon, Gary MacGillivray. Conditional Colourings with Given Template
77 -- 94Konstanty Junosza-Szaniawski, Pawel Rzazewski. An Exact Algorithm for the Generalized List T-Coloring Problem
95 -- 128Alexandr Valyuzhenich. On permutation complexity of fixed points of uniform binary morphisms
129 -- 146Jonathan L. Gross, Michal Kotrbcík, Timothy Sun. Genus distributions of cubic series-parallel graphs
147 -- 172Nándor Sieben, Ian Norris. Biased Weak Polyform Achievement Games
173 -- 188Ben Seamone. Bounding the monomial index and (1, l)-weight choosability of a graph
189 -- 202Hung-Chih Lee. Packing and covering the balanced complete bipartite multigraph with cycles and stars
203 -- 214Oleg Duginov. Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs
215 -- 228Kevin Buchin, Bettina Speckmann, Sander Verdonschot. On the Number of Regular Edge Labelings
229 -- 252Anthony Bonato, William B. Kinnersley, Pawel Pralat. Toppling numbers of complete and random graphs
253 -- 262Hal A. Kierstead, Karin Rebecca Saoub. Generalized Dynamic Storage Allocation
263 -- 278Olivier Baudon, Julien Bensmail, Eric Sopena. Partitioning Harary graphs into connected subgraphs containing prescribed vertices
279 -- 290Uéverton S. Souza, Fábio Protti, Maise Dantas da Silva. An algorithmic analysis of Flood-it and Free-Flood-it on graph powers
291 -- 304José Miguel Díaz-Báñez, Ruy Fabila Monroy, Pablo Pérez-Lantero. On the number of radial orderings of planar point sets
305 -- 316Shigeki Akiyama, Franz Gähler, Jeong-Yup Lee. Determining pure discrete spectrum for some self-affine tilings
317 -- 332Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl. Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane
333 -- 342Frédéric Havet, Nagarajan Paramaguru, Rathinasamy Sampathkumar. Detection number of bipartite graphs and cubic graphs

Volume 16, Issue 2

1 -- 20David Bryant, Paul F. Tupper. Diversities and the Geometry of Hypergraphs
21 -- 34Xuegang Chen, Jing Huang. Uniquely monopolar-partitionable block graphs
35 -- 40L. Sunil Chandran, Deepak Rajendraprasad, Nitin Singh. n
41 -- 56Andreas W. M. Dress, Katharina T. Huber, Mike A. Steel. A matroid associated with a phylogenetic tree
57 -- 72Pierre Charbit, Michel Habib, Antoine Mamcarz. Influence of the tie-break rule on the end-vertex problem
73 -- 86Igor da Fonseca Ramos, Vinícius l dos Santos, Jayme Luiz Szwarcfiter. Complexity aspects of the computation of the rank of a graph
87 -- 96Ryuhei Uehara. The graph isomorphism problem on geometric graphs
97 -- 110Balázs Keszegh, Balázs Patkós, Xuding Zhu. Nonrepetitive colorings of lexicographic product of graphs

Volume 16, Issue 1

1 -- 6Simon Mukwembi. On size, radius and minimum degree
7 -- 30Christian Löwenstein, Dieter Rautenbach, Roman Sotak. On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs
31 -- 60Milan Bradonjic, Gunes Ercal, Adam Meyerson, Alan Roytman. The Price of Mediation
61 -- 72Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher. Descents after maxima in compositions
73 -- 88Sylvain Gravier, Svante Janson, Tero Laihonen, Sanna Maarit Ranto. Graphs where every k-subset of vertices is an identifying set
89 -- 104Frédéric Havet, Andrew King. List circular backbone colouring
105 -- 120Dorota Kuziak, Iztok Peterin, Ismael González Yero. Efficient open domination in graph products
121 -- 142Serge Burckel, Emeric Gioan, Emmanuel Thomé. Computation with No Memory, and Rearrangeable Multicast Networks
143 -- 158Tomás Kaiser, Ondrej Rucký, Matej Stehlík, Riste Skrekovski. Strong parity vertex coloring of plane graphs
159 -- 178José Carlos Costa. Canonical forms for free κ-semigroups
179 -- 200Daniel Binkele-Raible, Henning Fernau. An Amortized Search Tree Analysis for Finding a k-Leaf Spanning Tree in an Undirected Graph
201 -- 206Hosam Abdo, Stephan Brandt, Darko Dimitrov. The Total Irregularity of a Graph
207 -- 224Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt. The Price of Connectivity for Vertex Cover
225 -- 232Olivier Baudon, Julien Bensmail, Rafal Kalinowski, Antoni Marczyk, Jakub Przybylo, Mariusz Wozniak. On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph
233 -- 286Julien Leroy. An S-adic characterization of minimal subshifts with first difference of complexity 1 ≤ p(n+1) - p(n) ≤ 2
287 -- 292Jiyun Guo, Jianhua Yin. A forcible version of Niessen's problem on degree sequences of graphs
293 -- 302Janusz Adamus, Lech Adamus, Anders Yeo. On the Meyniel condition for hamiltonicity in bipartite digraphs
303 -- 312Alice C. Niemeyer, Cheryl E. Praeger. Elements in finite classical groups whose powers have large 1-Eigenspaces
313 -- 326Rebecca J. Stones. Computing the number of h-edge spanning forests in complete bipartite graphs
327 -- 338Toufik Mansour, Mark Shattuck, Mark C. Wilson. Congruence successions in compositions
339 -- 354Xueliang Li, Yaping Mao. The generalized 3-connectivity of Lexicographic product graphs
356 -- 370Adrian Tanasa, Gérard Henry Edmond Duchamp, Loïc Foissy, Nguyen Hoang Nghia, Dominique Manchon. A combinatorial non-commutative Hopf algebra of graphs
371 -- 394Anna Chiara Lai, Paola Loreti. Robot's hand and expansions in non-integer bases