VII Latin American Workshop on Cliques in Graphs

November 8-11, 2016

La Plata, Argentina


Main Content

Contributed Papers covering original  work on the conference topics will be accepted for presentation. Each contributor must submit a one page  brief abstract in .pdf format  by e-mail to

using the following LaTex format: 


Submissions open on:  May 15, 2016.
Closing date for submissionsJune 30, 2016 July 25, 2016.
Notification of acceptance:  August  15, 2016.


The proceedings of the workshop will be published by Matemática Contemporânea, a journal of the Brazilian Mathematical Society.   All participants of the conference are invited to submit an extended abstract (6 pages maximum) describing their contributions.  The submitted papers will go through the normal review process. Please follow the formatting guidelinesof Matemática Contemporânea

Extended abstracts must be submitted by e-mail to

after the workshop. The deadline for the submissions to this special issue is March April 15th, 2017.



Due to several suggestions, we decided to upload the slides of the presentations given during the Workshop. Here you can find most of them.

(3,4,6)-Fullerene Graphs, Combinatorial Curvature Concept, Bipartite Edge Frustration and Maximum Independent Set, Diego S. Nicodemos, Sulamita Klein and Luerbio Faria.

1-identifying codes on Caterpillar Graphs, Juliana Félix and Márcia Cappelle

A linear algorithm for the k-tuple chromatic number of partner limited graphs, Flavia Bonomo, Ivo Koch and Mario Valencia-Pabon.

A watermarking scheme for structured programs, Lucila Bento, Davidson Boccardo, Raphael Machado, Vinícius Pereira de Sá and Jayme Szwarcfiter.

Algorithms for Deadlock Resolution in Subcubic Graphs, Alan Diêgo A. Carneiro, Fábio Protti and Uéverton Souza.

Biclique graph of a subclass of split graphs, Marina Groshaus, André Guedes and Juan Pablo Puppo.

Bounds on the number of tessellations in graphs, Alexandre S. Abreu, Luís Felipe I. Cunha, Franklin L. Marquezino and Luis Antonio B. Kowada.

Characterization and linear-time detection of minimal obstructions to concave-round graphs and the circular-ones property, Martín D. Safe.

Characterization by forbidden induced graphs of some subclasses of chordal graphs, Sérgio H. Nogueira and Vinicius F. dos Santos.

Characterization of the CPT posets in the k-tree class, L. Alcón, N. Gudiño and M. Gutierrez.

Characterizing Probe Unit Interval Graphs within the Class of Interval Graphs, Luciano Norberto Grippo.

Códigos Corretores de Erros e Cliques de Grafos, Natália Pedroza, Jayme Szwarcfiter and Paulo Eustáquio.

Convex p-partitions and convex p-covers, Lucía González, Luciano Grippo, Martín Safe and Vinicius F. Dos Santos.

Critical Ideals of Digraphs, Carlos A. Alfaro, Carlos E. Valencia and Adrián Vázquez.

Equitable total coloring of complete r-partite graphs, A. da Silva, S. Dantas and D. Sasaki.

Equitable total colouring of Loupekine Snarks and its products, Luana Cordeiro, Simone Dantas and Diana Sasaki.

Fractional isomorphism of graphs and hipergraphs and its applications, Flavia Bonomo and Dora Tilli.

In-Neighbor Convexity in Digraphs, Alessandra A. Pereira and Carmen C. Centeno.

Integrality of minimal unit circular-arc models, Francisco J. Soulignac and Pablo Terlisky.

K5-free Clique Graphs with each Triangle Contained in at most one K4 with Unique Critical Generator, Gabriela Ravenna and Liliana Alcón.

Locating-Dominating Partitions in Graphs, Ignacio M. Pelayo, Carmen Hernando and Mercè Mora.

Minimal forbidden induced subgraphs characterization of Block B0-VPG graphs, L. Alcón, F. Bonomo and M. P. Mazzoleni.

On a class of 3-intersection graphs of paths of a tree, C. Bornstein, J. Pinto and J. Szwarcfiter.

On Clique Corona Graphs - A Short Survey, Eugen Mandrescu and Vadim E. Levit.

On Convex Partitions of Graphs in the Triangle Path Convexity, Gislane Natália de Souza Miranda, Vinícius Fernandes dos Santos, Elizabeth Fialho Wanner and Maurício Collares.

On graphs with linear convergence, Flavia Bonomo, Martín Frías Armenta and Leopoldo Taravilse.

On the complexity of k-tuple total and total {k}-dominations, V. Leoni, G. Argiro and P. Torres.

On the diclique-behavior of digraphs, Marisa Gutierrez, Bernardo LLano and Silvia B. Tondato.

On the geodesic Carathéodory number for cartesian product of graphs, Diane Castonguay, Eduardo S. Lira, Erika M. M. Coelho and Hebert Coelho da Silva.

On the P3-Hull Number of the Cartesian Product of Graphs, Julliano R. Nascimento, Erika M. M. Coelho, Hebert Coelho and Jayme L. Szwarcfiter.

On the problem of finding all minimum spanning trees, João Guilherme Martinez, Rosiane de Freitas and Altigran Silva.

On unit d–interval graphs, G. Durán, F. Fernández Slezak, L. Grippo, F. Oliveira and J. Szwarcfiter.

Optimal Edge Fault-Tolerant Embedding of a Star over a Cycle, Tadashi Akagi, Eduardo A. Canale and Claudio E. Risso.

Parameterized Complexity of List Coloring Problems, Simone Gama, Rosiane de Freitas and Uéverton Souza.

The Petersen Graph Synchronizes, Eduardo Canale.

Structural characterization of minimal completions from interval to proper interval graphs, Nina Pardal, Mario Valencia-Pabon and Guillermo Durán.

The Short Block–Move Closest Permutation Problem is NP-complete, Luís Felipe I. Cunha, Vinícius F. dos Santos, Luis Antonio B. Kowada and Celina M. H. de Figueiredo.

The strict terminal connection problem with a bounded number of routers, Alexsander A. Melo, Celina M. H. de Figueiredo and Uéverton S. Souza.

Total Dominating Sequences In Trees, Split Graphs, And Under Modular Decomposition, Boštjan Brešar, Tim Kos, Graciela Nasini and Pablo Torres.

Using PMaxSat Techniques to Solve the Maximum Clique Problem, Alexandre Prusch Züge, Renato Carmo, Ricardo Tavares de Oliveira and Fabiano Silva.

Worst Case Instances for Maximum Clique Algorithms and How to Avoid Them, Alexandre Prusch Züge and Renato Carmo.