Now showing items 1-1 of 1

    • 3-colorability of pseudo-triangulations 

      Aichholzer, Oswin; Aurenhammer, Franz; Hackl, Thomas; Huemer, Clemens; Pilz, Alexander; Vogtenhuber, Birgit (2015)
      Open Access
      Deciding 3-colorability for general plane graphs is known to be an NP-complete problem. However, for certain families of graphs, like triangulations, polynomial time algorithms exist. We consider the family of pseudo-tri ...