Pages that link to "Item:Q4320470"
From MaRDI portal
The following pages link to Small graphs with chromatic number 5: A computer search (Q4320470):
Displayed 18 items.
- Remarks on a conjecture of Barát and Tóth (Q405159) (← links)
- On degree sums of a triangle-free graph (Q465274) (← links)
- On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number (Q539861) (← links)
- Integer sequence discovery from small graphs (Q908306) (← links)
- Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \) (Q968410) (← links)
- The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\) (Q998415) (← links)
- Partitioning graphs into complete and empty graphs (Q1045126) (← links)
- Gallai's problem on Dirac's construction (Q1197042) (← links)
- The size of a minimum five-chromatic \(K_ 4\)-free graph (Q1313876) (← links)
- (\(\Delta-k\))-critical graphs (Q1767668) (← links)
- Note on a conjecture of Toft (Q1900186) (← links)
- Chromatic vertex Folkman numbers (Q2195230) (← links)
- Questions on color-critical subgraphs (Q2657088) (← links)
- (Q4993797) (← links)
- Small minimal $(3, 3)$-Ramsey graphs (Q4994194) (← links)
- The smallest 5-chromatic tournament (Q6076253) (← links)
- A note on Reed's conjecture for triangle-free graphs (Q6080563) (← links)
- On some generalized vertex Folkman numbers (Q6115430) (← links)