Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Sarnath:1990:PCG, author = "R. Sarnath and Xin He", title = "A {P}-Complete Graph Partition Problem", journal = j-THEOR-COMP-SCI, volume = "76", number = "2-3", pages = "343--351", day = "21", month = nov, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., State Univ. of New York, Buffalo, NY, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; different than majority labelling; graph theory; lexicographical first DTML; P-complete graph partition problem; planar graphs; polynomial time sequential algorithm", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }