 | 2011 |
| 27 |  | C. N. Campos,
Simone Dantas,
Célia Picinin de Mello:
The total-chromatic number of some families of snarks.
Discrete Mathematics 311(12): 984-988 (2011) |
| 2009 |
| 26 |  | Simone Dantas,
Sulamita Klein,
Célia Picinin de Mello,
Aurora Morgana:
The Graph Sandwich Problem for P4-sparse graphs.
Discrete Mathematics 309(11): 3664-3673 (2009) |
| 25 |  | Vagner Pedrotti,
Célia Picinin de Mello:
Minimal separators in P4-tidy graphs.
Electronic Notes in Discrete Mathematics 35: 71-76 (2009) |
| 2008 |
| 24 |  | Sheila Morais de Almeida,
Célia Picinin de Mello,
Aurora Morgana:
Using Latin Squares to Color Split Graphs.
CTW 2008: 123-126 |
| 23 |  | C. N. Campos,
Célia Picinin de Mello:
The total chromatic number of some bipartite graphs.
Ars Comb. 88: (2008) |
| 22 |  | C. N. Campos,
Simone Dantas,
Célia Picinin de Mello:
Colouring clique-hypergraphs of circulant graphs.
Electronic Notes in Discrete Mathematics 30: 189-194 (2008) |
| 21 |  | Sheila Morais de Almeida,
Célia Picinin de Mello,
Aurora Morgana:
Edge Coloring of Split Graphs.
Electronic Notes in Discrete Mathematics 30: 21-26 (2008) |
| 2007 |
| 20 |  | Marco Liverani,
Aurora Morgana,
Célia Picinin de Mello:
The K-behaviour of p-trees.
Ars Comb. 83: (2007) |
| 19 |  | C. N. Campos,
Célia Picinin de Mello:
A result on the total colouring of powers of cycles.
Discrete Applied Mathematics 155(5): 585-597 (2007) |
| 2006 |
| 18 |  | Célia Picinin de Mello,
Aurora Morgana,
Marco Liverani:
The clique operator on graphs with few P4's.
Discrete Applied Mathematics 154(3): 485-492 (2006) |
| 17 |  | Caterina De Simone,
Célia Picinin de Mello:
Edge-colouring of join graphs.
Theor. Comput. Sci. 355(3): 364-370 (2006) |
| 2005 |
| 16 |  | Simone Dantas,
Sulamita Klein,
Célia Picinin de Mello,
Aurora Morgana:
The P4-sparse Graph Sandwich Problem.
Electronic Notes in Discrete Mathematics 22: 185-188 (2005) |
| 15 |  | C. N. Campos,
Célia Picinin de Mello:
The total chromatic number of some bipartite graphs.
Electronic Notes in Discrete Mathematics 22: 557-561 (2005) |
| 2004 |
| 14 |  | Aurora Morgana,
Célia Picinin de Mello,
Giovanna Sontacchi:
An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid.
Discrete Applied Mathematics 141(1-3): 225-241 (2004) |
| 13 |  | Francisco Larrión,
Célia Picinin de Mello,
Aurora Morgana,
Victor Neumann-Lara,
Miguel A. Pizaña:
The clique operator on cographs and serial graphs.
Discrete Mathematics 282(1-3): 183-191 (2004) |
| 12 |  | C. N. Campos,
Célia Picinin de Mello:
A result on the total colouring of powers of cycles.
Electronic Notes in Discrete Mathematics 18: 47-52 (2004) |
| 2003 |
| 11 |  | Celina M. Herrera de Figueiredo,
João Meidanis,
Célia Picinin de Mello,
Carmen Ortiz:
Decompositions for the edge colouring of reduced indifference graphs.
Theor. Comput. Sci. 297(1-3): 145-155 (2003) |
| 2002 |
| 10 |  | Celina M. Herrera de Figueiredo,
John G. Gimbel,
Célia Picinin de Mello,
Jayme Luiz Szwarcfiter:
A note on transitive orientations with maximum sets of sources and sinks.
Discrete Applied Mathematics 120(1-3): 91-95 (2002) |
| 2001 |
| 9 |  | Aurora Morgana,
Célia Picinin de Mello,
Giovanna Sontacchi:
An algorithm for 1-bend embeddings of planar graphs in the two-dimensional grid.
Electronic Notes in Discrete Mathematics 7: 38-41 (2001) |
| 2000 |
| 8 |  | Celina M. Herrera de Figueiredo,
Célia Picinin de Mello,
Carmen Ortiz:
Edge Colouring Reduced Indifference Graphs.
LATIN 2000: 145-153 |
| 1999 |
| 7 |  | Celina M. Herrera de Figueiredo,
John G. Gimbel,
Célia Picinin de Mello,
Jayme Luiz Szwarcfiter:
Even and Odd Pairs in Comparability and in P4-comparability Graphs.
Discrete Applied Mathematics 91(1-3): 293-297 (1999) |
| 6 |  | Celina M. Herrera de Figueiredo,
John G. Gimbel,
Célia Picinin de Mello,
Jayme Luiz Szwarcfiter:
Linear-time Algorithms for Maximum Sets of Sources and sinks.
Electronic Notes in Discrete Mathematics 3: 230-234 (1999) |
| 5 |  | Celina M. Herrera de Figueiredo,
João Meidanis,
Célia Picinin de Mello:
Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs.
Inf. Process. Lett. 70(3): 147-152 (1999) |
| 1998 |
| 4 |  | Cláudio Leonardo Lucchesi,
Célia Picinin de Mello,
Jayme Luiz Szwarcfiter:
On clique-complete graphs.
Discrete Mathematics 183(1-3): 247-254 (1998) |
| 1997 |
| 3 |  | Celina M. Herrera de Figueiredo,
João Meidanis,
Célia Picinin de Mello:
On Edge-Colouring Indifference Graphs.
Theor. Comput. Sci. 181(1): 91-106 (1997) |
| 1995 |
| 2 |  | Celina M. Herrera de Figueiredo,
João Meidanis,
Célia Picinin de Mello:
On Edge-Colouring Indifference Graphs.
LATIN 1995: 286-299 |
| 1 |  | Celina M. Herrera de Figueiredo,
João Meidanis,
Célia Picinin de Mello:
A Linear-Time Algorithm for Proper Interval Graph Recognition.
Inf. Process. Lett. 56(3): 179-184 (1995) |