Logo PTI
Polish Information Processing Society
Logo FedCSIS

Annals of Computer Science and Information Systems, Volume 2

Proceedings of the 2014 Federated Conference on Computer Science and Information Systems

An efficient algorithm for the density Turán problem of some unicyclic graphs

Halina Bielak, Kamil Powroźnik

DOI: http://dx.doi.org/10.15439/2014F297

Citation: Proceedings of the 2014 Federated Conference on Computer Science and Information Systems, M. Ganzha, L. Maciaszek, M. Paprzycki (eds). ACSIS, Vol. 2, pages 479–486 (2014)

Full text

Abstract. Let $H=(V(H),E(H))$ be a simple connected graph of order $n$ with the vertex set $V(H)$ and the edge set $E(H)$. We consider a blow-up graph $G[H]$.