Back to Results
First PageMeta Content
Graph theory / NP-complete problems / Graph coloring / Triangle-free graph / Treewidth / Independent set / Planar graph / Line graph / Perfect graph / Dominating set / Clique cover / Graph minor


Algorithmica:385–414 DOIs00453Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs George B. Mertzios · Paul G. Spirakis
Add to Reading List

Document Date: 2016-01-12 16:30:06

Open Document

File Size: 746,89 KB

Share Result on Facebook