On k-colorability of (\textit{bull},H)-free graphs

DOI10.1016/J.DISC.2026.115054MaRDI QIDQ6835822zbMATH OpenFDO

Authors Nadzieja Hodur, Monika Pilśniak, Magdalena Prorok, Ingo Schiermeyer

Publication date 30 March 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115054

zbMATH Keywords

4-colorable graphscomplexityforbidden induced subgraphsperfect graphs

Mathematics Subject Classification ID

Combinatorics (05-XX) Coloring of graphs and hypergraphs (05C15)

This page was built for publication: On \(k\)-colorability of (\textit{bull},\(H\))-free graphs

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