Cite
Covering codes in Sierpiński graphs.
MLA
Beaudou, Laurent, et al. “Covering Codes in Sierpiński Graphs.” Discrete Mathematics & Theoretical Computer Science (DMTCS), vol. 12, no. 3, June 2010, pp. 63–74. EBSCOhost, widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=asx&AN=60988999&authtype=sso&custid=ns315887.
APA
Beaudou, L., Gravier, S., Klavžar, S., Kovše, M., & Mollard, M. (2010). Covering codes in Sierpiński graphs. Discrete Mathematics & Theoretical Computer Science (DMTCS), 12(3), 63–74.
Chicago
Beaudou, Laurent, Sylvain Gravier, Sandi Klavžar, Matjaž Kovše, and Michel Mollard. 2010. “Covering Codes in Sierpiński Graphs.” Discrete Mathematics & Theoretical Computer Science (DMTCS) 12 (3): 63–74. http://widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=asx&AN=60988999&authtype=sso&custid=ns315887.