Pages that link to "Item:Q5713442"
From MaRDI portal
The following pages link to Approximation and Online Algorithms (Q5713442):
Displaying 18 items.
- Asymptotic probabilities of extension properties and random \(l\)-colourable structures (Q764265) (← links)
- Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number (Q1092065) (← links)
- Flexible coloring (Q1944945) (← links)
- On the \(c\)-strong chromatic number of \(t\)-intersecting hypergraphs (Q1945950) (← links)
- Zero-free intervals of chromatic polynomials of hypergraphs (Q2005730) (← links)
- Relating hypergraph parameters of generalized power graphs (Q2056895) (← links)
- Pruned inside-out polytopes, combinatorial reciprocity theorems and generalized permutahedra (Q2112572) (← links)
- Concepts on coloring of cluster hypergraphs with application (Q2196923) (← links)
- Complete colourings of hypergraphs (Q2279996) (← links)
- Strong colourings of hypergraphs (Q2881412) (← links)
- The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree (Q3057634) (← links)
- (Q3166098) (← links)
- (Q3421917) (← links)
- Random hypergraph coloring algorithms and the weak chromatic number (Q3708840) (← links)
- Strongly set-colorable graphs (Q4621304) (← links)
- Strong k-colourings of graphs (Q4809513) (← links)
- STRONG COLORINGS OVER PARTITIONS (Q5009680) (← links)
- Subdivision of hypergraphs and their colorings (Q5106713) (← links)