Table of Contents

• Canonical colourings in random graphsNina Kamcev, Mathias Schacht. 5-12 [doi]
• A canonical Ramsey theorem with list constraints in random graphsJosé D. Alvarado, Yoshiharu Kohayakawa, Patrick Morris 0001, Guilherme Oliveira Mota. 13-19 [doi]
• Descriptive complexity of controllable graphsAida Abiad, Anuj Dawar, Octavio Zapata. 20-27 [doi]
• On prescribing total orders for bipartite sets of distances in the Euclidean PlaneGerardo L. Maldonado, Miguel Raggi, Edgardo Roldán-Pensado. 28-34 [doi]
• Hyper-heuristics with Path Relinking applied to the Generalised Time-Dependent ATSP in air travelMatheus Simões, Laura Bahiense, Celina Figueiredo. 35-42 [doi]
• Greediness is not always a vice: Efficient Discovery Algorithms for Assignment ProblemsRomaric Duvignau, Ralf Klasing. 43-52 [doi]
• Edge and non-edge differentiated biclique graphsEdmilson Pereira da Cruz, Marina Groshaus, André Luiz Pires Guedes. 53-61 [doi]
• Characterization of graphs with perfect closed neighbourhood matricesM. Escalante, Erica G. Hinrichsen. 62-69 [doi]
• Online vector bin packing and hypergraph coloring illuminated: simpler proofs and new connectionsYaqiao Li, Denis Pankratov. 70-77 [doi]
• Crossing numbers of complete bipartite graphsJózsef Balogh, Bernard Lidický, Sergey Norin, Florian Pfender, Gelasio Salazar, Sam Spiro. 78-87 [doi]
• Least corank for the nonexistence of uniformly most reliable graphsPablo Romero, Martín D. Safe. 88-95 [doi]
• Reductions for the 3-Decomposition ConjectureOliver Bachtler, Irene Heinrich. 96-103 [doi]
• Mutual-visibility in distance-hereditary graphs: a linear-time algorithmSerafino Cicerone, Gabriele Di Stefano. 104-111 [doi]
• Computacional complexity of Hajós constructions of symmetric odd cyclesJorge Cervantes-Ojeda, Juan Carlos García-Altamirano, Mika Olsen. 112-120 [doi]
• Resource Augmentation Analysis of the Greedy Algorithm for the Online Transportation ProblemStephen Arndt, Josh Ascher, Kirk Pruhs. 121-129 [doi]
• Preprocessing complexity for some graph problems parameterized by structural parametersManuel Lafond, Weidong Luo. 130-139 [doi]
• Biclique transversal and biclique independen setMarina Groshaus, Juan Carlos Terragno. 140-147 [doi]
• Min-max coverage problems on tree-like metricsEric Aaron, Úrsula Hébert-Johnson, Danny Krizanc, Daniel Lokshtanov. 148-156 [doi]
• Identifying codes in bipartite graphs of given maximum degreeDipayan Chakraborty, Florent Foucaud, Tuomo Lehtilä. 157-165 [doi]
• Unavoidable patterns in 2-colorings of the complete bipartite graphAdriana Hansberg, Denae Ventura. 166-174 [doi]
• The Conversion Set Problem on GraphsIsac Costa, Carlos V. G. C. Lima, Thiago Marcilon. 175-183 [doi]
• Polarity on H-split graphsFernando Esteban Contreras-Mendoza, César Hernández-Cruz. 184-192 [doi]
• Resilience for loose Hamilton cyclesJosé D. Alvarado, Yoshiharu Kohayakawa, Richard Lang, Guilherme Oliveira Mota, Henrique Stagni. 193-200 [doi]
• Obstructions for χ-diperfectnessCaroline Aparecida de Paula Silva, Cândida Nunes da Silva, Orlando Lee. 201-208 [doi]
• The Problem of Discovery in Version Control SystemsLaurent Bulteau, Pierre-Yves David, Florian Horn 0001. 209-216 [doi]
• Graphs of minimum degree at least ⌊d/2⌋ and large enough maximum degree embed every tree with d verticesJoseph Hyde, Bruce Reed. 217-222 [doi]
• Five edge-independent spanning treesAlonso Ali, Orlando Lee. 223-230 [doi]
• Semi-proper orientations of dense graphsJ. Araujo, Frédéric Havet, Cláudia Linhares Sales, Nicolas Nisse, Karol Suchan. 231-240 [doi]
• Managing Time Expanded Networks through Project and Lift: the Lift IssueJosé Luis Figueroa González, Alain Quilliot, Hélène Toussaint, Annegret Wagler. 241-249 [doi]
• Kochol superposition of Goldberg with Semi-blowup snarks is Type 1Miguel A. D. R. Palma, Simone Dantas, Diana Sasaki. 250-257 [doi]
• Characterization of balanced graphs within claw-free graphsLucía Busolini, Guillermo Durán, Martín D. Safe. 258-266 [doi]
• Sidon sets and Sidon-partitions in cyclic groups through almost different setsLuis-Miguel Delgado, Amanda Montejano, Hamilton Ruiz, Carlos Trujillo. 267-274 [doi]
• On the absolute and relative oriented clique problems' time complexityErika Morais Martins Coelho, H. Coelho, L. Faria, M. P. Ferreira, S. Klein. 275-282 [doi]
• Mixed integer programming and quadratic programming formulations for the interval count problemLívia Salgado Medeiros, Fabiano de S. Oliveira, Abilio Lucena, Jayme Luiz Szwarcfiter. 283-291 [doi]
• Simple certifying algorithms for variants of the (2, 1)-colouring problemFernando Esteban Contreras-Mendoza, César Hernández-Cruz. 292-301 [doi]
• On nonrepetitive colorings of cyclesFábio Botler, Wanderson Lomenha, João Pedro de Souza. 302-307 [doi]
• A de Bruijn and Erdös property in quasi-metric spaces with four pointsGabriela Araujo-Pardo, Martín Matamala, J. Zamora. 308-315 [doi]
• Spherical fullerene graphs that do not satisfy Andova and Škrekovski's conjectureThiago M. D. Silva, Diego S. Nicodemos, Simone Dantas. 316-324 [doi]
• Graphs with constant balancing numberYair Caro, Ileana González-Escalante, Adriana Hansberg, Mariel Jácome, Tonatiuh Matos Wiederhold, Amanda Montejano. 325-333 [doi]
• A general approximation for multistage subgraph problemsMarkus Chimani, Niklas Troost, Tilo Wiedera. 334-342 [doi]
• Recovering cyclic tilings through β-skeletonsHéctor Saib Maravillo Gómez, Gilberto Calvillo Vives, Erick Treviño-Aguilar. 343-351 [doi]
• Counting lines in semi-complete digraphs *Gabriela Araujo-Pardo, Martín Matamala, José Zamora. 352-359 [doi]
• 1 distanceLehilton Lelis Chaves Pedrosa, Lucas de Oliveira Silva. 360-366 [doi]
• On general packing functions in graphs (Brief Announcement)Erica Hinrichsen, Graciela Nasini, Natalí Vansteenkiste. 367-369 [doi]
• Fair subgraph selection for contagion containment (Brief Announcement)Esther M. Arkin, Rezaul Alam Chowdhury, Mayank Goswami 0001, Jason Huang, Joseph S. B. Mitchell, Valentin Polishchuk, Rakesh Ravindran. 370-372 [doi]
• Biclique coloring game (Brief Announcement)Paola T. P. Huaynoca, Simone Dantas, Daniel F. D. Posner. 373-375 [doi]
• On the detection of local and global amoebas: theoretical insights and practical algorithms (Brief Announcement)Marcos E. González Laffitte, J. René González-Martínez, Amanda Montejano. 376-378 [doi]
• Cops and robber on variants of retracts and subdivisions of oriented graphs (Brief Announcement)Harmender Gahlawat, Zin Mar Myint, Sagnik Sen 0001. 379-381 [doi]
• Adjacent vertex distinguishing total coloring of corona products (Brief Announcement)Hanna Furmanczyk, Rita Zuazua. 382-384 [doi]
• Common edge independence number of a tree (Brief Announcement)Magda Dettlaff, Magdalena Lemanska, Jerzy Topp. 385-387 [doi]
• P3-Carathéodory number on graphs with diameter two (Brief Announcement)Erika M. M. Coelho, Hebert Coelho, Braully Rocha. 388-390 [doi]
• A polyhedral study of a relaxation of the routing and spectrum allocation problem (Brief Announcement)Federico Bertero, Hervé Kerivin, Javier Marenco, Annegret Wagler. 391-393 [doi]
• Complexity and winning strategies of graph convexity games (Brief Announcement)Samuel N. Araújo, Raquel Folz, Rosiane de Freitas, Rudini Sampaio. 394-396 [doi]
• On the hull and interval numbers of oriented graphs (Brief Announcement)J. Araújo, Ana Karolinna Maia, P. P. Medeiros, Lucia Draque Penso. 397-399 [doi]
• Positional Knapsack Problem: NP-hardness and approximation scheme (Brief Announcement)Lehilton L. C. Pedrosa, Mauro R. C. da Silva, Rafael C. S. Schouery. 400-402 [doi]
• 2) (Brief Announcement)T. Ahmed, Luis Boza, M. P. Revuelta, María Isabel Sanz Domínguez. 403-405 [doi]
• Voltage graphs as a technique to obtaining semi-cubic cages (Brief Announcement)Flor Aguilar-Campos, Gabriela Araujo-Pardo, Leah Berman. 406-408 [doi]