Relations among the fractional chromatic, choice, Hall, and Hall-condition numbers of simple graphs

DOI10.1016/S0012-365X(01)00117-0zbMath0991.05047OpenAlexW2013530559MaRDI QIDQ5951936

Anthony J. W. Hilton, Peter D. jun. Johnson, Amir Daneshgar

Publication date: 8 January 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00117-0

zbMATH Keywords

fractional chromaticHall numberslist-multicoloringvertex independence number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (11)

1-subdivisions, the fractional chromatic number and the Hall ratio ⋮ Maximum directed cuts in graphs with degree constraints ⋮ Counterexamples to a Conjecture of Harris on Hall Ratio ⋮ Hall's theorem and extending partial Latinized rectangles ⋮ Coloring the vertices of a graph with measurable sets in a probability space ⋮ Hall ratio of the Mycielski graphs ⋮ List multicoloring problems involving the k-fold Hall numbers ⋮ Unnamed Item ⋮ On the ultimate lexicographic Hall-ratio ⋮ The fractional chromatic number, the Hall ratio, and the lexicographic product ⋮ On cylindrical graph construction and its applications

This page was built for publication: Relations among the fractional chromatic, choice, Hall, and Hall-condition numbers of simple graphs