Clique chromatic numbers of intersection graphs

DOI10.1134/S0001434619010152zbMath1419.05086OpenAlexW2939563029WikidataQ128115487 ScholiaQ128115487MaRDI QIDQ2313617

D. A. Zakharov, Andrei M. Raigorodskii

Publication date: 19 July 2019

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434619010152

zbMATH Keywords

intersection graphclique chromatic number

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10)

Related Items (12)

On a Frankl-Wilson theorem ⋮ Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ New bounds on clique-chromatic numbers of Johnson graphs ⋮ On the independence number and the chromatic number of generalized preferential attachment models ⋮ On stability of the independence number of a certain distance graph ⋮ New bounds for the clique-chromatic numbers of Johnson graphs ⋮ Modularity of some distance graphs ⋮ Chromatic numbers of distance graphs without short odd cycles in rational spaces ⋮ Chromatic numbers of Kneser-type graphs ⋮ On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\) ⋮ On the chromatic number of random subgraphs of a certain distance graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intersection theorems with geometric consequences
• Clique-coloring claw-free graphs
• Clique-coloring some classes of odd-hole-free graphs
• The Chromatic Number of Kneser Hypergraphs
• Coloring the Maximal Cliques of Graphs
• Combinatorial Geometry and Coding Theory*
• On the chromatic numbers of small-dimensional Euclidean spaces

This page was built for publication: Clique chromatic numbers of intersection graphs