A Tight Linear Bound to the Chromatic Number of $(P_5, K_1+(K_1\cup K_3))$-Free Graphs.

Wei Dong Baogang Xu Yian Xu

Published in: Graphs Comb. (2023)

Keyphrases

upper bound
small number
lower bound
worst case
learning algorithm
image segmentation
multiscale
computational complexity
graph theory
weighted graph
finite number
maximum number
determined automatically