Back to Results
First PageMeta Content
Graph operations / List coloring / Dominating set / Cograph / Graph / Bipartite graph / Degeneracy / Graph homomorphism / Graph theory / Graph coloring / NP-complete problems


Choosability of P5-free graphs∗ Petr A. Golovach†
Add to Reading List

Document Date: 2009-05-31 05:49:27

Open Document

File Size: 155,48 KB

Share Result on Facebook

City

Bergen / /

Country

Norway / /

Currency

pence / /

/

Facility

University of Bergen / /

IndustryTerm

polynomialtime solution / recursive algorithm / greedy algorithm / /

Organization

Research Council of Norway / Department of Informatics / University of Bergen / /

Person

Petr A. Golovach† Pinar Heggernes / /

Technology

greedy algorithm / main algorithm / recursive algorithm / /

SocialTag