Pages that link to "Item:Q6132869"
From MaRDI portal
The following pages link to Nordhaus–Gaddum problem in terms of G-free coloring (Q6132869):
Displaying 5 items.
- The complexity of \(G\)-free colourability (Q1356726) (← links)
- Essentially disjoint families, conflict free colorings and Shelah's revised GCH (Q2448972) (← links)
- Chromatic sums for colorings avoiding monochromatic subgraphs (Q2516680) (← links)
- (Q4255999) (← links)
- Some bounds on the size of maximum G-free sets in graphs (Q6174763) (← links)