Journal: Discrete Mathematics & Theoretical Computer Science

Volume 15, Issue 3

1 -- 12Reza Naserasr, Edita Rollová, Eric Sopena. Homomorphisms of planar signed graphs to signed projective cubes
13 -- 20Raquel S. F. Bravo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti. 4's
21 -- 30Crevel Bautista-Santiago, Javier Cano, Ruy Fabila Monroy, David Flores-Peñaloza, Hernán González-Aguilar, Dolores Lara, Eliseo Sarmiento, Jorge Urrutia. On the connectedness and diameter of a Geometric Johnson Graph
31 -- 40Andrej Taranenko. A new characterization and a recognition algorithm of Lucas cubes
41 -- 60Silvio Capobianco, Pierre Guillon, Jarkko Kari. Surjective cellular automata far from the Garden of Eden
61 -- 72Mariusz Grech, Andrzej Kisielewicz. The Černý conjecture for automata respecting intervals of a directed graph
73 -- 100Parikshit Kolipaka, Sathish Govindarajan. Two player game variant of the Erdős-Szekeres problem
101 -- 118Krzysztof Krzywdzinski, Dariusz R. Kowalski. On the complexity of distributed BFS in ad hoc networks with spontaneous wake-up
119 -- 126Dániel Gerbner. The Magnus-Derek game in groups
127 -- 138Rafal Witkowski, Janez Zerovnik. 1-local 33/24-competitive Algorithm for Multicoloring Hexagonal Graphs
139 -- 154Prosenjit Bose, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Perouz Taslakian. Coloring and Guarding Arrangements
155 -- 166Delia Garijo, Antonio González Herrera, Alberto Márquez. The resolving number of a graph

Volume 15, Issue 2

1 -- 12Charlotte A. C. Brennan, Arnold Knopfmacher. Descent variation of samples of geometric variables
13 -- 32Adrien Boussicault. Operations on partially ordered sets and rational identities of type A
33 -- 48Mathilde Bouvel, Luca Ferrari. On the enumeration of d-minimal permutations
49 -- 58L. Sunil Chandran, Rogers Mathew. Bipartite Powers of k-chordal Graphs
59 -- 70Pablo Barenbaum, Verónica Becher, Alejandro Deymonnaz, Melisa Halsband, Pablo Ariel Heiber. Efficient repeat finding in sets of strings via suffix arrays
71 -- 86Luc Devroye, Linda Farczadi. Connectivity for line-of-sight networks in higher dimensions
87 -- 94Paul D. Manuel, Bharati Rajan, Indra Rajasingh, P. Vasanthi Beulah. Improved Bounds on the Crossing Number of Butterfly Network
95 -- 120Jean-Marc Champarnaud, Hadrien Jeanne, Ludovic Mignot. Derivatives of Approximate Regular Expressions
121 -- 138Edyta Szymanska. The Complexity of 2-Coloring and Strong Coloring in Uniform Hypergraphs with High Degrees
139 -- 156Marcella Anselmo, Maria Madonia. A Stronger Recognizability Condition for Two-dimensional Languages
157 -- 164Xiumei Wang, Cheng He, Yixun Lin. Removable Edges in Near-bricks
165 -- 176Josef Slapal. Topological structuring of the digital plane
177 -- 194Flavia Bonomo, Guillermo Durán, Luciano N. Grippo, Martín Darío Safe. Probe interval graphs and probe unit interval graphs on superclasses of cographs
195 -- 214Piotr Borowiecki, Dariusz Dereniowski. On-line ranking of split graphs
215 -- 222Shonda Gosselin, Artur Szymanski, Adam Pawel Wojda. Cyclic partitions of complete nonuniform hypergraphs and complete multipartite hypergraphs
223 -- 232Jirí Fiala, Marcin Kaminski, Daniël Paulusma. A note on contracting claw-free graphs
233 -- 242Tinaz Ekim, Marc Demange. A note on the NP-hardness of two matching problems in induced subgrids
243 -- 258Shuchao Li, HuiHui Zhang, Xiaoyan Zhang. Maximal independent sets in bipartite graphs with at least one cycle
259 -- 270Marcel Wild, Svante Janson, Stephan G. Wagner, Dirk Laurie. Coupon collecting and transversals of hypergraphs

Volume 15, Issue 1

1 -- 14José Cáceres, Delia Garijo, Antonio González Herrera, Alberto Márquez, María Luz Puertas. The determining number of Kneser graphs
15 -- 28Ben Seamone, Brett Stevens. Sequence variations of the 1-2-3 Conjecture and irregularity strength
29 -- 36Anne Lacroix, Narad Rampersad. Automaticity of Primitive Words and Irreducible Polynomials
37 -- 54Marek Cygan, Marcin Pilipczuk, Riste Skrekovski. A bound on the number of perfect matchings in Klee-graphs
55 -- 74Martiniano Eguía, Francisco J. Soulignac. Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration
75 -- 92Joy Elizabeth Singleton, Alewyn Petrus Burger. Further results on Maximal Nontraceable graphs of smallest size
93 -- 100Ruy Fabila Monroy, Luis Felipe Barba Flores, Dolores Lara, Jesús Leaños, Cynthia Rodríguez, Gelasio Salazar, Francisco Zaragoza. The Erdős-Sós Conjecture for Geometric Graphs
101 -- 106Aijun Dong, Guizhen Liu, Guojun Li. List Edge and List Total Colorings of Planar Graphs without non-induced 7-cycles
107 -- 120Pavel Skums, Yury Metelsky, Olga Glebova. Krausz dimension and its generalizations in special graph classes
121 -- 132Peter Mark Kayll, Dave Perkins. A chip-firing variation and a new proof of Cayley's Formula
133 -- 146Mariusz Grech, Andrzej Kisielewicz. All totally symmetric colored graphs
147 -- 156Anja Kohl. The b-chromatic number of powers of cycles
157 -- 182Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy Spinrad, Jayme Luiz Szwarcfiter. Isomorphism of graph classes related to the circular-ones property
183 -- 200Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne. A generic method for the enumeration of various classes of directed polycubes