Lower bounds on the clique-chromatic numbers of some distance graphs
From MaRDI portal
Publication:2043671
Recommendations
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 7024788 (Why is no real title available?)
- scientific article; zbMATH DE number 5218478 (Why is no real title available?)
- A counterexample to Borsuk’s conjecture
- An improved bound for the stepping-up lemma
- Clique coloring of dense random graphs
- Clique-coloring circular-arc graphs
- Clique-coloring some classes of odd-hole-free graphs
- Clique-transversal sets of line graphs and complements of line graphs
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- Coloring the Maximal Cliques of Graphs
- Colouring clique-hypergraphs of circulant graphs
- Combinatorial Theorems on Classifications of Subsets of a Given Set
- Families of sets with no matchings of sizes 3 and 4
- Intersection theorems with geometric consequences
- New bounds for the clique-chromatic numbers of Johnson graphs
- New bounds on clique-chromatic numbers of Johnson graphs
- On small \(n\)-uniform hypergraphs with positive discrepancy
- On the independence number and the chromatic number of generalized preferential attachment models
- On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
- Panchromatic 3-colorings of random hypergraphs
- Partition-free families of sets
- Perfect graphs of arbitrarily large clique-chromatic number
- Sharp results concerning disjoint cross-intersecting families
- The Borsuk partition problem: the seventieth anniversary
Cited in
(3)
This page was built for publication: Lower bounds on the clique-chromatic numbers of some distance graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2043671)
