Graph theory and algorithms: fifth Latin-American workshop on cliques in graphs

Celina de Figueiredo, Marisa Gutierrez, Prof Fabio Protti, Claudia Sales

Complexity of greedy edge-colouring

The Grundy index of a graph G =(V, E) is the greatest number of colours that the greedy edge-colouring algorithm can use on G. We prove that the problem of determining the Grundy index of a graph G=(V, E) is NP-h...

Authors: Frédéric Havet, A. Karolinna Maia and Min-Li Yu

Citation: Journal of the Brazilian Computer Society 2015 21:18

Content type: Research Published on: 9 November 2015
- View Full Text
- View PDF
Chordal- (k,ℓ)and strongly chordal- (k,ℓ)graph sandwich problems

In this work, we consider the graph sandwich decision problem for property Π, introduced by Golumbic, Kaplan and Shamir: given two graphs G¹=(V,E¹) and G²=(V,E²), the question is to know whether there exists a gr...

Authors: Fernanda Couto, Luerbio Faria and Sulamita Klein

Citation: Journal of the Brazilian Computer Society 2014 20:16

Content type: Research Published on: 11 September 2014
- View Full Text
- View PDF