Small graphs with chromatic number 5: A computer search
From MaRDI portal
Recommendations
Cited in
(22)- Partitioning graphs into complete and empty graphs
- Gallai's problem on Dirac's construction
- The size of a minimum five-chromatic \(K_ 4\)-free graph
- On the small graphs with chromatic number 5 without 4-cliques
- (\(\Delta-k\))-critical graphs
- Note on a conjecture of Toft
- Chromatic vertex Folkman numbers
- Questions on color-critical subgraphs
- Remarks on a conjecture of Barát and Tóth
- On degree sums of a triangle-free graph
- On the vertex Folkman numbers \(F_v(\underbrace{2,\dots,2}_R;R-1)\) and \(F_v(\underbrace{2,\dots,2}_R;R-2)\)
- Small minimal (3, 3)-Ramsey graphs
- On minimal triangle-free 6-chromatic graphs
- Bounds for the smallest k-chromatic graphs of given girth
- On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number
- The smallest 5-chromatic tournament
- A note on Reed's conjecture for triangle-free graphs
- On some generalized vertex Folkman numbers
- Spectral extremal problems for non-bipartite graphs without odd cycles
- Integer sequence discovery from small graphs
- Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \)
- The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\)
This page was built for publication: Small graphs with chromatic number 5: A computer search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4320470)
