Conference Program

LAWCG 2012
Book of Abstracts
Conference Program
November 4th
1
Welcome Ceremony (19:30)
Welcome Cocktail (20:00)
November 5th
1
Plenary Talk (9:00–9:50)
2 Cliques and Relatives – Bounds and Structures
Dieter Rautenbach
1
Combinatorial Games and Orders (10:00–10:40)
3 Solitaire Clobber played on cartesian product of graphs
Simone Dantas, Sylvain Gravier, Telma Pará
3
4 Arboreal jump number of an order
Adriana Pimenta, Michael Habib, Sulamita Klein, Jayme Szwarcfiter
Coffee Break (10:40–11:00)
Intersection Graphs (11:00–12:20)
5 EPT graphs on bounded degree trees
Liliana Alcón, Marisa Gutierrez, María Pía Mazzoleni
5
6 On basic chordal graphs and some of its subclasses
Pablo De Caria, Marisa Gutierrez
7 Interval count of generalizations of threshold graphs
Márcia Cerioli, Fabiano Oliveira, Jayme Szwarcfiter
8 Modelos DV que pueden enraizarse
Marisa Gutierrez, Silvia Tondato
Lunch (12:20–15:30)
Graph Operators (15:30–16:50)
9 Self-diclique digraph
Ana P. Figueroa, Marietjie Frick, Bernardo Llano, Rita Zuazua
9
10 On Clique Graphs of Chordal Comparability Graphs
Michel Habib, Denis Julien, Vinícius Fernandes dos Santos, Ross M. McConnell,
Jayme L. Szwarcfiter
11 The Clique Operator Considered as a Functor
Paco Larrión, Miguel A. Pizaña, Rafael Villarroel-Flores
12 Clique Graphs and Topology
Paco Larrión, Miguel A. Pizaña, Rafael Villarroel-Flores
Coffee Break (16:50–17:20)
Bicliques (17:20–18:20)
13 A lower bound for the biclique-chromatic number
Hélio B. Macêdo Filho, Raphael C. S. Machado, Celina M. H. de Figueiredo
14 The star and biclique coloring and choosability problems
Marina Groshaus, Francisco Soulignac, Pablo Terlisky
iii
13
LAWCG 2012
Book of Abstracts
15 The biclique graph of some classes of graphs
Marina Groshaus, Juan Pablo Puppo
Algebraic Graph Theory and Domination (18:30–19:30)
16 Integer Index of n-broom-like graphs
Laura Patuzzi, Maria A. A. de Freitas, Renata R. Del-Vecchio
16
17 Dominating Induced Matchings
Min Chih Lin, Michel Mizrahi, Jayme Szwarcfiter
18 Efficient Multiple Domination
Rommel T. de Oliveira, Rommel M. Barbosa
Dinner + Salsa class
November 6th
19
Plenary Talk (9:00–9:50)
19 Interval Digraphs
Pavol Hell
19
Independent Sets (10:00–10:40)
20 Well-covered complementary prisms graphs
Rommel M. Barbosa, Márcia R. C. Santana
20
21 Enumeración de conjuntos independientes maximales en grafos bisplit
César Stuardo, Mónica Villanueva
Coffee Break (10:40–11:00)
Colorings and Generalizations I (11:00–12:20)
22 On the k, i-coloring problem
Flavia Bonomo, Guillermo Durán, Ivo Koch
22
23 On L(h, k)-coloring b-core limited graphs
Márcia R. Cerioli, Daniel F. D. Posner
24 Total chromatic number of some families of graphs with maximum degree 3
Simone Dantas, Celina M. H. de Figueiredo, Myriam Preissmann, Diana Sasaki
25 Minimal 3 × 3 M -obstruction cographs
Raquel S. F. Bravo, Fábio Protti, Loana T. Nogueira, Clautenis Viana
Lunch (12:20–13:45)
Trip to Luján (13:45–16:00)
Convexity I (16:00–17:00)
26 Geodetic Number Versus Hull Number in P3 -Convexity
Carmen C. Centeno, Lucia D. Penso, Dieter Rautenbach, and Vinícius G. P. de Sá
27 Elements of Geodetic Convexity Applied to Classes of Graphs and Some Results in
Distance-Hereditary Graphs
Mitre C. Dourado, Rodolfo A. Oliveira, Fabio Protti, Dieter Rautenbach
28 The Radon number on graphs
Alexandre Toman, Mitre C. Dourado, Jayme L. Szwarcfiter
Coffee Break (17:00–17:30)
iv
26
LAWCG 2012
Book of Abstracts
Applications (17:30–18:30)
29 Two Families of Cayley Graph Interconnection Networks
André C. Ribeiro, Celina M. H. Figueiredo, Luis Antonio B. Kowada
30 A Pre-Processing Procedure for The Bicluster Graph Editing Problem
Rian Gabriel S. Pinheiro, Ivan César Martins, Fábio Protti, Luiz Satoru Ochi
31 Clique-based and others IP models for graph coloring with constraints and scheduling
Rosiane de Freitas, Flávio Coelho, Clarice Santos, Simone Gama
29
Special Gala Dinner (20:00)
November 7th
32
Plenary Talk (9:30–10:20)
32 On the clique operator complexity
Luerbio Faria
32
Convexity II (10:30–11:10)
33 On the P3 -Local Carathéodory number
Rommel M. Barbosa, Erika M. M. Coelho, Dieter Rautenbach, Mitre C. Dourado,
Jayme L. Szwarcfiter
34 Uma Convexidade em Grafos Direcionados Acíclicos
Carmen C. Centeno, Mitre C. Dourado, Jayme L. Szwarcfiter
33
Coffee Break (11:10–11:30)
Colorings and Generalizations II (11:30–12:50)
35 AVD-total-coloring of complete equipartite graphs
Atílio G. Luiz, Christiane N. Campos, Célia P. de Mello
36 Multicolored Ramsey Numbers in Multipartite Graphs
Juliana Sanches, Emerson L. Monte Carmelo
37 Edge colouring bisplit graphs
Romina González, Carmen Ortiz, Mónica Villanueva
38 On selective-perfectness of graphs
Flavia Bonomo, Denis Cornaz, Tinaz Ekim-Asici, Bernard Ries
35
Lunch (12:50–15:30)
Algorithms and Complexity (15:30–16:50)
39 Feedback Vertex Set is NP-complete for Reducible Flow Hypergraphs
André L. P. Guedes, Lilian Markenzon, Luerbio Faria
40 Complexidade de Problemas de Conexão de Terminais
Uéverton dos Santos Souza, Rodolfo Alves de Oliveira, Fábio Protti
41 Searching for a NP-Complete Probe Graph Problem
Rafael B. Teixeira, Celin M. H. de Figueiredo, Simone Dantas
42 (k, ℓ)-sandwich problem: why not ask for special kinds of bread?
Fernanda Couto, Luerbio Faria, Sulamita Klein, Loana Nogueira, Fábio Protti
39
Coffee Break (16:50–17:20)
Check Out (18:00)
Index of Authors
43
v