Last update: Sun Mar 31 03:12:29 MDT 2019
@Article{Alcon:2013:SCG, author = "Liliana Alc{\'o}n and Luerbio Faria and Celina M. H. de Figueiredo and Marisa Gutierrez", title = "Split clique graph complexity", journal = j-THEOR-COMP-SCI, volume = "506", number = "??", pages = "29--42", day = "30", month = sep, year = "2013", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Oct 7 09:23:21 MDT 2013", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs2010.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0304397513005367", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", }