Clique chromatic numbers of intersection graphs

DOI10.1134/S0001434619010152MaRDI QIDQ2313617zbMATH OpenOpenAlexWikidataFDO

Authors D. 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)

Recommendations

• New bounds on clique-chromatic numbers of Johnson graphs
• Chromatic numbers of some distance graphs
• Clique coloring of dense random graphs
• Clique-chromatic numbers of line graphs.
• New bounds for the clique-chromatic numbers of Johnson graphs

Cites work

• scientific article; zbMATH DE number 6536189 (Why is no real title available?)
• scientific article; zbMATH DE number 3458659 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• Clique-coloring claw-free graphs
• Clique-coloring some classes of odd-hole-free graphs
• Coloring the Maximal Cliques of Graphs
• Combinatorial geometry and coding theory
• Intersection theorems with geometric consequences
• The Chromatic Number of Kneser Hypergraphs

Cited in

(22)

• scientific article; zbMATH DE number 7024788 (Why is no real title available?)
• Chromatic numbers of distance graphs without short odd cycles in rational spaces
• On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\)
• New bounds on the modularity of Johnson graphs and random subgraphs of Johnson graphs
• On the chromatic number of random subgraphs of a certain distance graph
• Bounded \(VC\)-dimension implies the Schur-Erdős conjecture
• Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
• Crossings, colorings, and cliques
• New bounds on clique-chromatic numbers of Johnson graphs
• Estimate of the number of edges in special subgraphs of a distance graph
• On the independence number and the chromatic number of generalized preferential attachment models
• The Clique Problem in Ray Intersection Graphs
• On a Frankl-Wilson theorem
• Modularity of some distance graphs
• scientific article; zbMATH DE number 798640 (Why is no real title available?)
• Chromatic numbers of Kneser-type graphs
• Box and Segment Intersection Graphs with Large Girth and Chromatic Number
• On stability of the independence number of a certain distance graph
• New bounds for the clique-chromatic numbers of Johnson graphs
• Minimum clique number, chromatic number, and Ramsey numbers
• On Cliques and Clique Chromatic Numbers in Line, Lict and Lictact Graphs
• Sharp bounds for the chromatic number of random Kneser graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2313617)