Clique chromatic numbers of intersection graphs
From MaRDI portal
Publication:2313617
DOI10.1134/S0001434619010152zbMATH Open1419.05086OpenAlexW2939563029WikidataQ128115487 ScholiaQ128115487MaRDI QIDQ2313617FDOQ2313617
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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10)
Cites Work
- Intersection theorems with geometric consequences
- Title not available (Why is that?)
- The Chromatic Number of Kneser Hypergraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial geometry and coding theory
- Coloring the Maximal Cliques of Graphs
- Clique-coloring some classes of odd-hole-free graphs
- Clique-coloring claw-free graphs
- On the chromatic numbers of small-dimensional Euclidean spaces
Cited In (22)
- On stability of the independence number of a certain distance graph
- Chromatic numbers of Kneser-type graphs
- On the chromatic number of random subgraphs of a certain distance graph
- On a Frankl-Wilson theorem
- Title not available (Why is that?)
- Crossings, colorings, and cliques
- New bounds on the modularity of Johnson graphs and random subgraphs of Johnson graphs
- The Clique Problem in Ray Intersection Graphs
- On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\)
- New bounds on clique-chromatic numbers of Johnson graphs
- On the independence number and the chromatic number of generalized preferential attachment models
- Chromatic numbers of distance graphs without short odd cycles in rational spaces
- New bounds for the clique-chromatic numbers of Johnson graphs
- Box and Segment Intersection Graphs with Large Girth and Chromatic Number
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- Sharp bounds for the chromatic number of random Kneser graphs
- Modularity of some distance graphs
- On Cliques and Clique Chromatic Numbers in Line, Lict and Lictact Graphs
- Title not available (Why is that?)
- Minimum clique number, chromatic number, and Ramsey numbers
- Estimate of the number of edges in special subgraphs of a distance graph
- Bounded \(VC\)-dimension implies the Schur-Erdős conjecture
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)
