Lower bounds on the clique-chromatic numbers of some distance graphs
From MaRDI portal
Publication:2043671
DOI10.2140/moscow.2021.10.141zbMath1469.05057OpenAlexW3175599215WikidataQ114045344 ScholiaQ114045344MaRDI QIDQ2043671
Publication date: 3 August 2021
Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/moscow.2021.10.141
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved bound for the stepping-up lemma
- Clique-transversal sets of line graphs and complements of line graphs
- Perfect graphs of arbitrarily large clique-chromatic number
- Intersection theorems with geometric consequences
- Families of sets with no matchings of sizes 3 and 4
- The Borsuk partition problem: the seventieth anniversary
- Sharp results concerning disjoint cross-intersecting families
- New bounds on clique-chromatic numbers of Johnson graphs
- On the independence number and the chromatic number of generalized preferential attachment models
- New bounds for the clique-chromatic numbers of Johnson graphs
- On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
- On small \(n\)-uniform hypergraphs with positive discrepancy
- Panchromatic 3-colorings of random hypergraphs
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- Clique-Coloring Circular-Arc Graphs
- A counterexample to Borsuk’s conjecture
- Clique-coloring some classes of odd-hole-free graphs
- Clique coloring of dense random graphs
- Coloring the Maximal Cliques of Graphs
- Partition‐free families of sets
- Combinatorial Theorems on Classifications of Subsets of a Given Set
- Colouring clique-hypergraphs of circulant graphs
This page was built for publication: Lower bounds on the clique-chromatic numbers of some distance graphs
