List-k-coloring H-free graphs for all k>4

DOI10.1007/S00493-024-00106-2MaRDI QIDQ6662691zbMATH OpenFDO

Authors Maria Chudnovsky, Sepehr Hajebi, Sohpie Spirkl

Publication date 14 January 2025

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00493-024-00106-2

zbMATH Keywords

coloringinduced subgraphslist-coloringpolynomial-time algorithms

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited in

(5)

• Acyclic, star and injective colouring: a complexity picture for H-free graphs
• Vertex-critical graphs in co-gem-free graphs
• Maximum list r-colorable induced subgraphs in kp₃-free graphs
• Incompatibility graphs in data mining
• Vertex-critical graphs in subfamilies of (P₄+ P₁)-free graphs

This page was built for publication: List-\(k\)-coloring \(H\)-free graphs for all \(k>4\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6662691)