Choosability on \(H\)-free graphs

DOI10.1016/j.ipl.2012.12.003zbMath1259.68092OpenAlexW1979794044MaRDI QIDQ1943624

Daniël Paulusma, Pim van 't Hof, Pinar Heggernes, Petr A. Golovach

Publication date: 20 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.12.003

zbMATH Keywords

computational complexitychoosabilitylinear forestH-free graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs

This page was built for publication: Choosability on \(H\)-free graphs