Coloring graphs with locally few colors
From MaRDI portal
Publication:1074595
DOI10.1016/0012-365X(86)90065-8zbMath0591.05030OpenAlexW2099554026WikidataQ105741804 ScholiaQ105741804MaRDI QIDQ1074595
Paul Erdős, Péter Komjáth, Vojtěch Rödl, Zoltan Fueredi, Andras Hajnal, Seress, Ákos
Publication date: 1986
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(86)90065-8
Related Items
Dynamic coloring of graphs having no \(K_5\) minor, Edge-colorings of 4-regular graphs with the minimum number of palettes, Local \(k\)-colorings of graphs and hypergraphs, On the extremal combinatorics of the Hamming space, On locally-perfect colorings, NP-completeness of local colorings of graphs, Colorings of complements of line graphs, Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank, Colorful subhypergraphs in Kneser hypergraphs, NP for Combinatorialists, Local orthogonality dimension, Local chromatic number of quadrangulations of surfaces, On the chromatic number of general Kneser hypergraphs, Coloring chains for compression with uncertain priors, Colorful subgraphs in Kneser-like graphs, Topological Bounds for Graph Representations over Any Field, Induced colorful trees and paths in large chromatic graphs, Vertex Cover in Graphs with Locally Few Colors, Colorful subhypergraphs in uniform hypergraphs, Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets, Local chromatic number and distinguishing the strength of topological obstructions, Local coloring of Kneser graphs, On colorings of graph powers, Local chromatic number and Sperner capacity, A generalization of the Erdős-Ko-Rado theorem, The chromatic discrepancy of graphs, Relations between the Local Chromatic Number and Its Directed Version
Cites Work
