Relations among the fractional chromatic, choice, Hall, and Hall-condition numbers of simple graphs
From MaRDI portal
Publication:5951936
DOI10.1016/S0012-365X(01)00117-0zbMath0991.05047MaRDI 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
05C15: Coloring of graphs and hypergraphs
Related Items
Counterexamples to a Conjecture of Harris on Hall Ratio, Unnamed Item, On cylindrical graph construction and its applications, Hall's theorem and extending partial Latinized rectangles, On the ultimate lexicographic Hall-ratio, The fractional chromatic number, the Hall ratio, and the lexicographic product, Coloring the vertices of a graph with measurable sets in a probability space, Maximum directed cuts in graphs with degree constraints, Hall ratio of the Mycielski graphs, 1-subdivisions, the fractional chromatic number and the Hall ratio, List multicoloring problems involving the k-fold Hall numbers