LAWCG 2026 - Detailed program
12th Latin American Workshop on Cliques in Graphs
Monday
Tuesday
Opening ceremony (slides)
Invited talk by Miguel Pizaña
On Locally Identifying Coloring of Cubic Graphs
Presenter: Luiz Carlos de Souza Almeida
Trie Mergesort: A unified approach to natural mergesorts
Presenter: Pedro Henrique Feitosa Fernandes
Locally identifying coloring in some split-comparability graphs
Presenter: Hebert Coelho da Silva
Dijkstra Graphs: Short-circuit evaluation
Presenter: Matheus Telles Batista; Matheus de Souza Feitosa
On Locally Identifying Coloring of some Circulant Graphs
Presenter: Ryan Fernandes Auder Lopes
Complexity of the Minimum Labeled Feedback Edge Set Problem
Presenter: Rafael de Paiva Lima Filho
Independent Locating-Dominating Sets in some Snark Families
Presenter: Dayllon Vinícius Xavier Lemos
Contagem de Triângulos em Fluxo de Grafos Utilizando Complexidade de Amostra
Presenter: Vitor Hugo Santos Alencar
Coffee break
Locating-dominating partitions and total variants for subcubic graphs
Presenter: Joviro Rocha Neto
Connectedness in Flip and Twist Reconfiguration Graphs of Colored Triangulations
Presenter: Daniel Debrohim dos Santos
Partial Independent k-Dominating Sets in a Superclass of Distance-Hereditary Graphs
Presenter: Vitor dos Santos Ponciano
A Lower Bound on the p-Inversion Diameter of Tournaments
Presenter: Lucas de Oliveira Silva
Geodesic mutual visibility in unit interval graphs
Presenter: Luis Gustavo da Soledade Gonzaga
Optimization Problems on Maya-Tupi Graphs
Presenter: Júlio César Silva Araújo
Exact Algorithm for Double Domination with Branch Cutting
Presenter: Iago Arruda Faria
Square roots of split graphs via matchings
Presenter: Aleffer Rocha
Lunch break
Advances on Clustered Colourings of Outerplanar Graphs
Presenter: Luis Gustavo da Soledade Gonzaga
Cliques and Convolutions: An Algebraic Approach to Counting Cliques in Sparse Graphs
Presenter: Miguel Alessandro Mini Huambachano
Jogos de Convexidades de Caminhos em Grafos
Presenter: Leon Araujo Almeida
Listing bicliques and cliques: Bipartite Permutation and Proper 2-Thin Graphs
Presenter: André Luiz Pires Guedes
Minimal Obstructions for Star Coloring in Chordal Graph Families
Presenter: Ana Laura Trujillo-Negrete
Finding Bicliques in Quantum Computing
Presenter: Leandro Miranda Zatesko
Algoritmos para o problema da supercoloração em digrafos (acíclicos) com número fixo de cores
Presenter: Pedro Guimarães Caninas
Reduced clique graphs: characterization, superclasses and subclasses
Presenter: Pablo Jesús De Caria Di Fonzo
Branch and Bound Algorithm for the Grundy Number Problem
Presenter: Eric Rodrigues Gomes
A Quadratic Characterization of the Weighted Lovász Theta Number and Related SDP Bounds
Presenter: Luis Henrique Gomes Higino
On Graceful Colorings of P(n,k)
Presenter: Abias Lins Palheiros Vidal
On the Cost of Perfection in Wheel Graphs
Presenter: Ingrid da Costa Silva Borchert
Coffee break
Round-table discussion
Wednesday
Invited talk by Ana Karolinna Maia
Adjacent Vertex Distinguishing Total Coloring in Complete 3- and 4-Partite Graphs
Presenter: Juliano Silva do Nascimento
Balanced distance-hereditary graphs
Presenter: Martín Darío Safe
On the AVD-total chromatic number of cubic graphs
Presenter: Mariana Martins Ferreira da Cruz
Intersection graphs characterizations
Presenter: Marina Esther Groshaus
Equitable Total Coloring of Complete Multipartite Graphs
Presenter: Sheila Morais de Almeida
Sobre atribuição de papéis em algumas subclasses de grafos cordais
Presenter: Gustavo Morais Medeiros
Equitable total chromatic number of graphs with universal vertex
Presenter: Claudiney dos Santos
Atribuição de papéis em produto corona de grafos analisando vértices gêmeos
Presenter: Julliano Rosa Nascimento
Coffee break
Towards the (2,1)-total number of complete equipartite graphs
Presenter: Mayara Midori Omai
Study of Carathéodory Number in Hypercubes
Presenter: Hebert Coelho da Silva
On total b-chromatic number of graph classes
Presenter: Clayton Santos de Araujo
Strongly chordal digraphs, total domination, and tournaments with possible loops
Presenter: César Hernández Cruz
Odd coloring of graphs and hypergraphs
Presenter: Nicolas de Melo Pedroso
An Approach to Canonical ESD Labelings in Sparse Graphs
Presenter: Danilo Artigas
Parity locally irregular decomposition of graphs
Presenter: Silas Justiniano Veiga da Silva
Triangle-free graphs whose line graph squares are C≥k-free
Presenter: Martín Darío Safe
Official workshop photograph
Lunch break
Collaborative group work or free time at the hotel
Coffee break
Outdoor activities or free time at the hotel
Conference dinner
Thursday
Invited talk by Maya Stein
Counting edge-colorings of a complete graph that avoid a rainbow K4
Presenter: Fabricio Siqueira Benevides
Normal Domination Partizan Game in Stars
Presenter: Edileudo Maciel Moreira Filho
Anti-Ramsey threshold for K₂,r in random graphs
Presenter: Juliane Kristine de Lima
On the Complexity of Fall Coloring for Subclasses of Chordal Graphs
Presenter: Vinicius Fernandes dos Santos
Minimum degree threshold for covering bipartite graphs with monochromatic components
Presenter: César Augusto dos Santos Bispo
O jogo da posição geral em alguns produtos fortes de grafos
Presenter: Hebert Coelho da Silva
Matching extendability in the Cartesian product of complete graphs
Presenter: Alessandra Aparecida Pereira
Global defensive alliance in lexicographic product of stars with paths or cycles
Presenter: Alessandra Barbosa Verissimo
Coffee break
König-Egerváry Index under Vertex Coalescence
Presenter: Eugen Mandrescu
Contributions toward the Flood-It Problem in co-comparability graphs
Presenter: Sheila Morais de Almeida
Transversally Transitive Unmatching Edge Graphs
Presenter: Edmilson Pereira da Cruz
Optimal containment for the firefighter problem on circular and Möbius ladders
Presenter: Wagner Alan Aparecido da Rocha
Mixed cages
Presenter: Claudia Marlene De la Cruz Torres