Table of Contents

• PrefaceLuciano N. Grippo, Martín D. Safe. 1-5 [doi]
• Stretching Operations Applied to Cliques of Edge Intersection Graphs of Paths in TreesMariana S. Escalante, Victoria Kaial, Annegret K. Wagler. 6-13 [doi]
• A polyhedral study of the berth allocation problem with tidesJavier Marenco. 14-21 [doi]
• Diameter constraints in 2-distance graphsOleksiy Al-saadi, Joseph Natal. 22-29 [doi]
• Trading Determinism for Time: The k-Reach ProblemRonak Bhadra, Raghunath Tewari. 30-37 [doi]
• A first exploration of the split-interval coloring polytopeDiego Delle Donne, Javier Marenco. 38-45 [doi]
• The Graph Coloring Game on 4 x n-GridsCaroline Brosse, Nicolas Almeida Martins, Nicolas Nisse, Rudini M. Sampaio. 46-53 [doi]
• Integer linear programs for the power dominating set problem with channel limitationMauro Lucci, Diego Delle Donne, Mariana S. Escalante. 54-61 [doi]
• Lower Bounds for Induced-Universal GraphsCyril Gavoille, Amaury Jacques. 62-69 [doi]
• A Weight Function Lemma Heuristic for Graph PebblingGuilherme Adamatti Bridi, Franklin de Lima Marquezino, Celina Miraglia Herrera de Figueiredo. 70-77 [doi]
• The Interplay Between Domination and Separation in GraphsDipayan Chakraborty, Annegret K. Wagler. 78-85 [doi]
• A polynomial-time algorithm recognizing exact cubes of treesLaurent Beaudou, Henry Echeverría, Florent Foucaud, Andrea Jiménez, Nikita Manuylenko, Anirudh Rachuri. 86-93 [doi]
• Minimizing breaks in incomplete round-robin tournamentsDominique de Werra, Sebastián Urrutia, Lucas Assunção. 94-101 [doi]
• An initial polyhedral study of the DR-AOV formulation for the routing and spectrum allocation problemFederico Bertero, Javier Marenco. 102-109 [doi]
• Acyclic α-diperfect digraphs with stability number twoCaroline Aparecida de Paula Silva, Cândida Nunes da Silva, Orlando Lee. 110-116 [doi]
• Partitioning problems in concave-round digraphs and tournamentsConstanza Gacitúa Fuentes, Nikolas Jara Cádiz, Pablo Opazo Salazar, Nicolás Sanhueza-Matamala, Christopher Thraves Caro. 117-124 [doi]
• Generalized Capacitated Vertex Separator Problem: Models and AlgorithmsSergio Anglada, Carmen Galé, Juan José Salazar González. 125-132 [doi]
• Backbone colouring of chordal graphsJúlio Araújo 0001, Nicolas Nisse, Lucas Picasarri-Arrieta. 133-140 [doi]
• Totally odd immersions of complete graphs in graph productsHenry Echeverría, Andrea Jiménez, Suchismita Mishra 0001, Daniel A. Quiroz, Mauricio Yépez. 141-148 [doi]
• Colouring defect of strong snarksJán Karabás, Edita Mácajová, Roman Nedela, Martin Skoviera. 149-155 [doi]
• Short cycle covers and the colouring defect of a cubic graphJán Karabás, Edita Mácajová, Roman Nedela, Martin Skoviera. 156-162 [doi]
• Are there any permutation snarks on 6 (mod 8) vertices?Edita Mácajová, Martin Skoviera. 163-168 [doi]
• A solution approach to districting modification and route optimization in waste collectionCamilo D'Aloisio, Guillermo Durán, Nazareno A. Faillace Mullen. 169-176 [doi]
• Construction of infinitely many trace-minimal graphs with maximum number of spanning treesPablo Romero, Louis Petingi. 177-184 [doi]
• Most reliable two-terminal graphs with distance constraintsPablo Romero. 185-192 [doi]
• Constructions of Small Regular Mixed Graphs with Girth 5 and 6Gabriela Araujo-Pardo, Lydia Mirabel Mendoza Cadena. 193-198 [doi]
• Type 1 and Type 2 Kochol superposition snarksRieli Araújo, Celina M. H. de Figueiredo, Diana Sasaki, Simone Dantas. 199-206 [doi]
• Perfect versus imperfect matching covers of cubic graphsRobert Lukotka, Makuochukwu F. Oguagbaka. 207-214 [doi]
• Riffle RankBenjamin Rossman. 215-222 [doi]
• Domination in Johnson graphsMaría Gracia Cornet, Tanja Dravec, Pablo Daniel Torres. 223-230 [doi]
• Optimized Routing for Residential Waste Collection in Mixed-Density AreasP. E. Coll, E. M. López. 231-238 [doi]
• Exploring subgraph complementation to bounded degree graphsIvo Koch, Nina Pardal, Vinícius Fernandes dos Santos. 239-246 [doi]
• Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph SparsityGiovanna Kobus Conrado, Amir Kafshdar Goharshady, Harshit Jitendra Motwani, Sergei Novozhilov. 247-254 [doi]
• Degree conditions for embedding antidirected trees in digraphsGeorge Kontogeorgiou, Giovanne Santos, Maya Stein. 255-260 [doi]
• Generating a cyclic 3-Gray code for integer partitions with maximum parts in constant amortized timeJiahui Shao, Dennis Wong, Ruizhe Zhou, Wei Ke. 261-268 [doi]
• Recognizing IO-RDV graphs in polynomial timeBruno Marinho, Ana Silva. 269-276 [doi]
• On the structure and diameter of graph associahedra of graphs with a set of true twinsAna Gargantini, Adrián Pastine, Pablo Daniel Torres. 277-284 [doi]
• Spectral properties of stellohedraAna Gargantini, Adrián Pastine, Pablo Daniel Torres, Mario Valencia-Pabon. 285-292 [doi]
• Inclusion graphs of biclique parts of K3-free graphsEdmilson Pereira da Cruz, Marina Groshaus, André Luiz Pires Guedes. 293-300 [doi]
• On the 2D Demand Bin Packing Problem: Hardness and Approximation AlgorithmsSusanne Albers, Waldo Gálvez, Ömer Behic Özdemir. 301-308 [doi]
• Minimum Number of Distinct Eigenvalues of Sunlet GraphsLuiz Emilio Allem, R. O. Braga, B. Scaratti, Lucas Siviero Sibemberg. 309-316 [doi]
• Vertex-separating path systems in treesMilene Gutiérrez, Nicolás Sanhueza-Matamala, Christopher Thraves Caro. 317-324 [doi]
• On {k}-Roman graphsKenny Storgel, Nina Chiarelli, Lara Fernández, Jochen Pascal Gollin, Claire Hilaire, Valeria Leoni, Martin Milanic. 325-332 [doi]
• k-Sachs-Critical GraphsDaniel A. Jaume, Diego G. Martinez, Cristian Panelo, Kevin Pereyra. 333-340 [doi]
• On musical arrangement problems time complexityN. Figueiredo, Luérbio Faria, Vinícius Fernandes dos Santos, Uéverton S. Souza. 341-348 [doi]
• Computational aspects of disks enclosing many pointsProsenjit Bose, Guillermo Esteban, Tyler Tuttle. 349-356 [doi]
• New framework for conflict-free coloring of hypergraphs and other graph coloring problemsMauro Lucci, Graciela L. Nasini, Paola B. Tolomei, Luis Miguel Torres. 357-364 [doi]
• Some complexity results on cycle-convex partitionsGuilherme C. M. Gomes, Laila M. V. Lopes, Vinícius Fernandes dos Santos. 365-372 [doi]
• The oriented chromatic number of a wheel and of the disjoint union of a wheel with a complete graphErika M. M. Coelho, Hebert Coelho, Luérbio Faria, Mateus de Paula Ferreira, Sulamita Klein. 373-380 [doi]
• Universality for degenerate hypergraphsPeter Allen 0001, Julia Böttcher, Jasmin Katz. 381-388 [doi]
• Game chromatic number of split and threshold graphsEder F. de Figueiredo, Vinícius Fernandes dos Santos. 389-396 [doi]
• Finding subdigraphs in digraphs of bounded directed treewidthRaul Lopes 0001, Ignasi Sau. 397-404 [doi]
• Strong conformable coloring: the conformable coloring for Type 1 graphsLuérbio Faria, Mauro Nigro, Diana Sasaki. 405-412 [doi]
• Space-Efficient Lyndon Array Construction from Compressed TextsDaniel Saad Nogueira Nunes, Felipe A. Louza, Guilherme P. Telles. 413-420 [doi]
• Minimum-density locating-dominating sets on infinite hexagonal grids with bounded heightArthur C. Gomes, Yoshiko Wakabayashi. 421-428 [doi]
• On total {k}-domination in caterpillar graphsMariana S. Escalante, María Inés Lopez Pujato, Paola B. Tolomei. 429-436 [doi]
• On complete immersions and topological boundsHenry Echeverría, Andrea Jiménez, Suchismita Mishra 0001, Adrián Pastine, Daniel A. Quiroz, Mauricio Yépez. 437-444 [doi]
• Rainbow separating path systemsAlexander Clifton, George Kontogeorgiou, S. Taruni, Ana Trujillo-Negrete. 445-452 [doi]
• Separating edges by linearly many subdivisionsGeorge Kontogeorgiou, Matías Pavez-Signé, Maya Stein, S. Taruni, Ana Trujillo-Negrete. 453-457 [doi]
• Total b-chromatic Colouring of GraphsFabricio Mendoza-Granada, David F. Manlove. 458-465 [doi]
• How to go from partial to full retroactivity in detailCristina G. Fernandes, Felipe C. Noronha. 466-473 [doi]
• Graphs with asymmetric Ramsey propertiesWalner Mendonça, Meysam Miralaei, Guilherme Oliveira Mota. 474-478 [doi]
• New lower bounds for the order of cagesClaudia Marlene de la Cruz, Miguel A. Pizaña. 479-484 [doi]
• Maya-Tupi graphs: a generalization of split graphsJúlio Araújo 0001, César Hernández-Cruz, Cláudia Linhares Sales. 485-492 [doi]
• Cops and Robbers on Token GraphsBruno Amezcua-Osorio, César Hernández-Cruz, Seyyed Aliasghar Hosseini, Humberto Lozano-Chávez, Gary MacGillivray. 493-500 [doi]
• Trees with proper thinness 2Flavia Bonomo-Braberman, Ignacio Maqueda, Nina Pardal. 501-508 [doi]
• A Parameterized Perspective on Uniquely Restricted MatchingsJuhi Chaudhary, Ignasi Sau, Meirav Zehavi. 509-516 [doi]
• Partitioning P5-free graphs into an independent set and a complete multipartite graphGermán Benítez-Bobadilla, Fernando Esteban Contreras-Mendoza, Juan Carlos García-Altamirano, César Hernández-Cruz, Juan José Montellano-Ballesteros. 517-524 [doi]
• Realizable signatures in upward pointset embeddings of directed pathsManuel A. Espinosa-García, Miguel Raggi, Edgardo Roldán-Pensado. 525-531 [doi]
• Graphs whose line graph square is P-freeMartín D. Safe, Martina Vergara. 532-539 [doi]