Pages that link to "Item:Q729801"
From MaRDI portal
The following pages link to Edge-coloring of 3-uniform hypergraphs (Q729801):
Displaying 10 items.
- The chromatic spectrum of 3-uniform bi-hypergraphs (Q409398) (← links)
- Three measures of edge-uncolorability (Q616368) (← links)
- 3-consecutive edge coloring of a graph (Q658096) (← links)
- Concepts on coloring of cluster hypergraphs with application (Q2196923) (← links)
- Complete colourings of hypergraphs (Q2279996) (← links)
- Reducing hypergraph coloring to clique search (Q2422750) (← links)
- A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2 (Q2488941) (← links)
- The matroid intersection cover problem (Q2661583) (← links)
- Edge intersection graphs of linear 3-uniform hypergraphs (Q5902100) (← links)
- Gap one bounds for the equitable chromatic number of block graphs (Q6558671) (← links)