Pages that link to "Item:Q6046762"
From MaRDI portal
The following pages link to THE CHROMATIC NUMBER OF -FREE GRAPHS (Q6046762):
Displaying 11 items.
- On graphs without a \(C_{4}\) or a diamond (Q531598) (← links)
- An anti-Ramsey theorem on diamonds (Q604664) (← links)
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs (Q712269) (← links)
- The size of a minimum five-chromatic \(K_ 4\)-free graph (Q1313876) (← links)
- Linearly \(\chi\)-bounding \((P_6,C_4)\)-free graphs (Q1687923) (← links)
- Chromatic number of ISK4-free graphs (Q1696549) (← links)
- Isolation of the diamond graph (Q2134972) (← links)
- On the chromatic number of (\(P_6\), diamond)-free graphs (Q2413634) (← links)
- Totally Multicolored diamonds (Q3503558) (← links)
- An optimal χ‐bound for (P6, diamond)‐free graphs (Q6080859) (← links)
- Structure of some \(( P_7, C_4)\)-free graphs with application to colorings (Q6611001) (← links)
