The following pages link to Colour Classes for r-Graphs (Q5668825):
Displaying 11 items.
- Unique factorization of compositive hereditary graph properties (Q270251) (← links)
- Graph properties and hypergraph colourings (Q1184854) (← links)
- The existence of uniquely \(-G\) colourable graphs (Q1377702) (← links)
- The subchromatic number of a graph (Q1823255) (← links)
- Minimal reducible bounds for induced-hereditary properties (Q1883266) (← links)
- The complexity of generalized graph colorings (Q1923585) (← links)
- Generalized hypergraph coloring (Q2214310) (← links)
- On generalized graph colorings (Q3748295) (← links)
- A Canonical Ramsey Theorem (Q4019375) (← links)
- ON UNIQUELY -G k-COLOURABLE GRAPHS (Q4034558) (← links)
- Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors (Q4944685) (← links)
