A linear-time algorithm for proper interval graph recognition CMH de Figueiredo, J Meidanis, CP de Mello Information Processing Letters 56 (3), 179-184, 1995 | 83 | 1995 |
A result on the total colouring of powers of cycles CN Campos, CP de Mello Discrete Applied Mathematics 155 (5), 585-597, 2007 | 61 | 2007 |
Total-chromatic number and chromatic index of dually chordal graphs CMH de Figueiredo, J Meidanis, CP de Mello Information processing letters 70 (3), 147-152, 1999 | 43 | 1999 |
The clique operator on cographs and serial graphs F Larrión, CP de Mello, A Morgana, V Neumann-Lara, MA Pizana Discrete Mathematics 282 (1-3), 183-191, 2004 | 36 | 2004 |
The total-chromatic number of some families of snarks CN Campos, S Dantas, CP de Mello Discrete Mathematics 311 (12), 984-988, 2011 | 33 | 2011 |
Edge-colouring of join graphs C De Simone, CP de Mello Theoretical computer science 355 (3), 364-370, 2006 | 30 | 2006 |
Local conditions for edge-coloring CM de Figueiredo, J Meidanis, CP de Mello Journal of Combinatorial Mathematics and Combinatorial Computing 32, 79-92, 2000 | 29 | 2000 |
On clique-complete graphs CL Lucchesi, CP de Mello, JL Szwarcfiter Discrete Mathematics 183 (1-3), 247-254, 1998 | 27 | 1998 |
Colouring clique-hypergraphs of circulant graphs CN Campos, S Dantas, CP de Mello Electronic Notes in Discrete Mathematics 30, 189-194, 2008 | 26 | 2008 |
On edge-colouring indifference graphs CMH de Figueiredo, J Meidanis, CP de Mello Theoretical computer science 181 (1), 91-106, 1997 | 24 | 1997 |
The graph sandwich problem for P4-sparse graphs S Dantas, S Klein, CP De Mello, A Morgana Discrete Mathematics 309 (11), 3664-3673, 2009 | 21 | 2009 |
The clique operator on graphs with few P4's CP de Mello, A Morgana, M Liverani Discrete applied mathematics 154 (3), 485-492, 2006 | 20 | 2006 |
The total chromatic number of some bipartite graphs CN Campos, CP Mello Ars Combinatoria 88, 335-348, 2008 | 18 | 2008 |
The total chromatic number of split-indifference graphs CN Campos, CH de Figueiredo, R Machado, CP de Mello Discrete Mathematics 312 (17), 2690-2693, 2012 | 17 | 2012 |
The total chromatic number of some bipartite graphs CN Campos, CP de Mello Electronic Notes in Discrete Mathematics 22, 557-561, 2005 | 15 | 2005 |
Decompositions for the edge colouring of reduced indifference graphs CMH de Figueiredo, J Meidanis, CP de Mello, C Ortiz Theoretical computer science 297 (1-3), 145-155, 2003 | 15 | 2003 |
Even and odd pairs in comparability and in P4-comparability graphs CMH de Figueiredo, J Gimbel, CP Mello, JL Szwarcfiter Discrete applied mathematics 91 (1-3), 293-297, 1999 | 13 | 1999 |
Colouring clique-hypergraphs of circulant graphs CN Campos, S Dantas, CP de Mello Graphs and Combinatorics 29 (6), 1713-1720, 2013 | 12 | 2013 |
Recognizing Well Covered Graphs of Families with Special P 4-Components S Klein, CP de Mello, A Morgana Graphs and Combinatorics 29, 553-567, 2013 | 12 | 2013 |
Local conditions for edge-colouring of cographs MM Barbosa, CP De Mello, J Meidanis Congressus Numerantium, 45-56, 1998 | 12 | 1998 |