Three complexity results on coloring P k -free graphs

Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma

Source record

Source: Crossref

Published: Apr 1, 2013

DOI: 10.1016/j.ejc.2011.12.008

Open original source ↗

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.