Pages that link to "Item:Q791320"
From MaRDI portal
The following pages link to On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems (Q791320):
Displayed 5 items.
- The strong chromatic number of partial triple systems (Q1101122) (← links)
- Graph properties and hypergraph colourings (Q1184854) (← links)
- Coloring face-hypergraphs of graphs on surfaces (Q1850616) (← links)
- Star chromatic numbers of hypergraphs and partial Steiner triple systems (Q1903717) (← links)
- The complexity of generalized graph colorings (Q1923585) (← links)