The chromatic number of \P₂ P₃, banner\-free graphs

DOI10.1016/J.AMC.2025.129707MaRDI QIDQ6897091zbMATH OpenFDO

Authors Jiali Long, Kaiyang Lan, Yan Wang

Publication date 20 November 2025

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AMC.2025.129707

zbMATH Keywords

\(P_2 \cup P_3\)bannercoloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites work

• A note on \(\Delta\)-critical graphs
• A strengthening of Brooks' theorem
• Borodin-Kostochka conjecture holds for \(\overline{K_{1 , 3}} \)-free graphs
• Borodin-Kostochka conjecture holds for odd-hole-free graphs
• Borodin-Kostochka's conjecture on \((P_5,C_4)\)-free graphs
• Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors
• Coloring \(\{ P 2 \cup P 3 , \operatorname{house} \} \)-free graphs with \(\Delta - 1\) colors
• Coloring Claw-Free Graphs with \Delta-1 Colors
• Coloring hammer-free graphs with \(\Delta - 1\) colors
• Graphs with \(\chi=\Delta\) have big cliques
• scientific article; zbMATH DE number 3043302 (Why is no real title available?)
• Improvement on Brooks' chromatic bound for a class of graphs
• On an upper bound of the graph's chromatic number, depending on the graph's degree and density
• Strengthening Brooks' chromatic bound on \(P_6\)-free graphs
• The chromatic number of graphs which induce neither \(K_{1,3}\) nor \(K_ 5-e\)

This page was built for publication: The chromatic number of \(\{P_2 \cup P_3,\text{ banner}\}\)-free graphs

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