Pages that link to "Item:Q2908131"
From MaRDI portal
The following pages link to Conflict-Free Colourings of Uniform Hypergraphs With Few Edges (Q2908131):
Displaying 11 items.
- Unique-maximum coloring of plane graphs (Q907833) (← links)
- Remarks on proper conflict-free colorings of graphs (Q2099465) (← links)
- Colorings with neighborhood parity condition (Q2172422) (← links)
- 2-colorability of \(r\)-uniform hypergraphs (Q2318778) (← links)
- Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs (Q2515567) (← links)
- On Conflict-Free Multi-coloring (Q3449809) (← links)
- 1-planar graphs are odd 13-colorable (Q6041551) (← links)
- On conflict-free proper colourings of graphs without small degree vertices (Q6056427) (← links)
- Conflict‐free chromatic number versus conflict‐free chromatic index (Q6057644) (← links)
- A note on the conflict-free chromatic index (Q6197755) (← links)
- Defective coloring of hypergraphs (Q6201037) (← links)
