Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Khuller:1991:PGC, author = "S. Khuller and V. V. Vazirani", title = "Planar graph coloring is not self-reducible, assuming {P} {not=NP}", journal = j-THEOR-COMP-SCI, volume = "88", number = "1", pages = "183--189", day = "30", month = sep, year = "1991", 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 = "Inst. for Adv. Comput. Studies, Maryland Univ., College Park, MD, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; graph colouring; lexicographically first four coloring; NP hardness; planar graph; planar graph four-coloring; self-reducibility; Turing complexity", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }