Algorithmica:385–414 DOIs00453Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs George B. Mertzios · Paul G. Spirakis - Book:Physics - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2016-01-12 16:30:06 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 Source URL: community.dur.ac.uk Download Document from Source Website File Size: 746,89 KB Share Document on Facebook

	Approximately coloring graphs without long induced paths Maria Chudnovsky ∗ Princeton University, Princeton, NJOliver Schaudt Universit¨at zu K¨oln, K¨oln, Germany Sophie Spirkl DocID: 1qQpe - View Document
	3-coloring triangle-free planar graphs with a precolored 8-cycle Zdenˇek Dvoˇra´k ∗ DocID: 1qClZ - View Document
	Decision Tree Complexity, Solvable Groups, and the Distribution of Prime Numbers Joint Work 2010 L´ DocID: 1qB9m - View Document
	Algorithmica:385–414 DOIs00453Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs George B. Mertzios · Paul G. Spirakis DocID: 1qc3P - View Document
	The k -in-a-path problem for claw-free graphs ´ + , Bernard Lidický∗ , Jiˇrí Fiala∗ , Marcin Kaminski Daniël Paulusma∗∗ Charles University∗ Université Libre de Bruxelles+ DocID: 1pUII - View Document