Set colourings of graphs

DOI10.1016/0012-365X(79)90148-1zbMath0403.05038OpenAlexW4210698998MaRDI QIDQ1255964

Béla Bollobás, Andrew G. Thomason

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1016/0012-365x(79)90148-1

zbMATH Keywords

Kneser graphR-set colorationR-set coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

\(k\)-tuple chromatic number of the Cartesian product of graphs, Chromatic invariants for finite graphs: Theme and polynomial variations, Monochromatic tree covers and Ramsey numbers for set-coloured graphs, Planar graphs without 4- and 6-cycles are (7 : 2)-colorable, Generalized k-tuple colorings of cycles and other graphs, Exact and Parameterized Algorithms for (k, i)-Coloring, New results in \(t\)-tone coloring of graphs, On the tractability of \(( k , i )\)-coloring, \(k\)-tuple colorings of the Cartesian product of graphs, Graph theory (algorithmic, algebraic, and metric problems), The \(t\)-tone chromatic number of random graphs, On ordered set systems and some conjectures related to the erdös–ko–rado theorem and turán's theorem, NP-completeness of a family of graph-colouring problems, On the fractional chromatic number and the lexicographic product of graphs

Cites Work

• Unnamed Item
• r-tuple colorings of uniquely colorable graphs
• The chromatic number and other functions of the lexicographic product
• Applications of product colouring
• A (<5)-Colour Theorem for Planar Graphs
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS