Pages that link to "Item:Q5110643"
From MaRDI portal
The following pages link to On minimal triangle‐free 6‐chromatic graphs (Q5110643):
Displaying 13 items.
- On the structure of \(C_3\)-critical minimal 6-connected graphs (Q291173) (← links)
- The size of a minimum five-chromatic \(K_ 4\)-free graph (Q1313876) (← links)
- Chromatic vertex Folkman numbers (Q2195230) (← links)
- On the chromatic number of (\(P_6\), diamond)-free graphs (Q2413634) (← links)
- Questions on color-critical subgraphs (Q2657088) (← links)
- Maximal sets of triangle-factors onv = 6m vertices (Q4222154) (← links)
- Small graphs with chromatic number 5: A computer search (Q4320470) (← links)
- (Q4359588) (← links)
- (Q5133126) (← links)
- The exponential growth of the packing chromatic number of iterated Mycielskians (Q6069170) (← 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)