Journal of the Brazilian Computer Society

Branch and bound algorithms for the maximum clique problem under a unified framework
Contributions of Jayme Luiz Szwarcfiter to graph theory and computer science
Determining what sets of trees can be the clique trees of a chordal graph
Editorial
Gene clusters as intersections of powers of paths
Graph theory and algorithms
On clique-colouring of graphs with few P 4’s
On the classification problem for split graphs
Sandwich problems on orientations
The interval count of interval graphs and orders: a short survey