Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
From MaRDI portal
Publication:6615757
DOI10.1016/j.jctb.2024.07.002zbMath1548.05129MaRDI QIDQ6615757
Publication date: 8 October 2024
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
graph coloringedge coloringindependence numberclique numbertriangle-freefractional coloringlist coloringReed's conjecturedegree-sequencelocal demands
Linear programming (90C05) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
This page was built for publication: Fractional coloring with local demands and applications to degree-sequence bounds on the independence number