Local \(k\)-colorings of graphs and hypergraphs
From MaRDI portal
Publication:1095156
DOI10.1016/0095-8956(87)90017-7zbMath0632.05041MaRDI QIDQ1095156
Publication date: 1987
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(87)90017-7
edge-coloring; Ramsey theory; bipartite graphs; chromatic number; induced subgraph; monochromatic copy; local k-coloring
Related Items
Generalized local colorings of graphs, Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets, A note on local colorings of graphs, Zero-sum problems -- a survey