1. On an upper bound of a graph’s chromatic number, depending on the graph’s degree and density;Borodin;J. Combin. Theory Ser. B,1997
2. On Colouring the Nodes of a Network;Brooks,1941
3. Embedding Subgraphs and Coloring Graphs under Extremal Degree Conditions;Catlin,1976
4. Borodin–Kostochka conjecture holds for odd-hole-free graphs;Chen;Graphs Combin.,2024
5. Coloring {P2∪P3,house}-free graphs with Δ−1 colors;Chen;Discrete Appl. Math.,2024