Skip to main content

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

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

  1. Research

    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...

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

    Journal of the Brazilian Computer Society 2015 21:18

    Published on: 9 November 2015

  2. Research

    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 G1=(V,E1) and G2=(V,E2), the question is to know whether there exists a gr...

    Fernanda Couto, Luerbio Faria and Sulamita Klein

    Journal of the Brazilian Computer Society 2014 20:16

    Published on: 11 September 2014