A 2-parametric generalization of Sierpiński gasket graphsJakovac, Marko (Avtor) teorija grafovkromatično številoSierpińskijev grafgraph theorychromatic numberSierpiński graphsSierpiński gasket graphshamiltonicityGraphs ▫$S[n,k]$▫ are introduced as the graphs obtained from the Sierpiński graphs ▫$S(n,k)$▫ by contracting edges that lie in no triangle. The family ▫$S[n,k]$▫ is a previously studied class of Sierpiñski gasket graphs ▫$S_n$▫. Several properties of graphs ▫$S[n,k]$▫ are studied in particular, hamiltonicity and chromatic number.20092015-07-10 15:07:30Delo ni kategorizirano51774ISSN: 1318-4865UDK: 519.174OceCobissID: 44310272COBISS_ID: 15085145NUK URN: URN:SI:UM:DK:HCNA2NNJsl