Pages that link to "Item:Q507574"
From MaRDI portal
The following pages link to On variants of conflict-free-coloring for hypergraphs (Q507574):
Displaying 7 items.
- Theory and application of conflict resolution with hybrid preference in colored graphs (Q350409) (← links)
- On \(k\)-strong conflict-free multicoloring (Q1708616) (← links)
- Essentially disjoint families, conflict free colorings and Shelah's revised GCH (Q2448972) (← links)
- Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs (Q2515567) (← links)
- Conflict-free colourings of uniform hypergraphs with few edges (Q2908131) (← links)
- Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs (Q5745127) (← links)
- An algebraic formulation of hypergraph colorings (Q6106296) (← links)