The following pages link to Coloring sparse hypergraphs (Q2813339):
Displaying 13 items.
- The independent neighborhoods process (Q312273) (← links)
- Linear coloring of sparse graphs (Q412383) (← links)
- On coloring uniform hypergraphs without 3-cycles (Q446271) (← links)
- Coloring graphs with sparse neighborhoods (Q1569053) (← links)
- On proper colorings of hypergraphs (Q1930218) (← links)
- Coloring hypergraphs of low connectivity (Q2073648) (← links)
- Constructions of sparse uniform hypergraphs with high chromatic number (Q3055877) (← links)
- Harmonious coloring of uniform hypergraphs (Q5279870) (← links)
- A GRASP for coloring sparse graphs (Q5938473) (← links)
- Independence number of hypergraphs under degree conditions (Q6076735) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- Coloring unions of nearly disjoint hypergraph cliques (Q6144279) (← links)
- Defective coloring of hypergraphs (Q6201037) (← links)