![](/images/ico/ico_close.png)
![](/images/ico/ico3.png)
Publisher: Springer Publishing Company
Founded in: 1981
Total resources: 8
E-ISSN: 1678-4804
ISSN: 0104-6500
Subject: TP3 Computers
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Journal of the Brazilian Computer Society
Menu
![](/images/ico/ico5.png)
Determining what sets of trees can be the clique trees of a chordal graph
Journal of the Brazilian Computer Society , Vol. 18, Iss. 2, 2012-06 , pp.![](/images/ico/ico5.png)
Graph theory and algorithms: Fourth Latin-American Workshop on Cliques in Graphs
By Figueiredo Celina in (2012)
Journal of the Brazilian Computer Society , Vol. 18, Iss. 2, 2012-06 , pp.![](/images/ico/ico5.png)
Gene clusters as intersections of powers of paths
Journal of the Brazilian Computer Society , Vol. 18, Iss. 2, 2012-06 , pp.![](/images/ico/ico5.png)
The interval count of interval graphs and orders: a short survey
Journal of the Brazilian Computer Society , Vol. 18, Iss. 2, 2012-06 , pp.![](/images/ico/ico5.png)
![](/images/ico/ico5.png)
Sandwich problems on orientations
By Durand de Gevigney Olivier in (2012)
Journal of the Brazilian Computer Society , Vol. 18, Iss. 2, 2012-06 , pp.![](/images/ico/ico5.png)
Contributions of Jayme Luiz Szwarcfiter to graph theory and computer science
Journal of the Brazilian Computer Society , Vol. 18, Iss. 2, 2012-06 , pp.![](/images/ico/ico5.png)
On clique-colouring of graphs with few
By Klein Sulamita,Morgana Aurora in (2012)
Journal of the Brazilian Computer Society , Vol. 18, Iss. 2, 2012-06 , pp.![](/images/ico/ico5.png)
Branch and bound algorithms for the maximum clique problem under a unified framework
By Carmo Renato,Züge Alexandre in (2012)
Journal of the Brazilian Computer Society , Vol. 18, Iss. 2, 2012-06 , pp.![](/images/ico/ico5.png)
On the classification problem for split graphs
By Morais de Almeida Sheila in (2012)
Journal of the Brazilian Computer Society , Vol. 18, Iss. 2, 2012-06 , pp.