Aug 2026
A bound for the chromatic number of (P2 ∪ P4,diamond)-free graphs
A hereditary class [Formula: see text] of graphs is [Formula: see text]-bounded if there is a [Formula: see text]-binding function, say [Formula: see text], such that [Formula: see text], for every [Formula: see text], where [Formula: see text] denotes the chromatic (clique) number of [Formula: see text]. A [Formula: s...
Li Zhang, Xia Hong
· Discrete Mathematics, Algori... · 0 citations