Journal: Discrete Mathematics & Theoretical Computer Science

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