Pages that link to "Item:Q2891368"
From MaRDI portal
The following pages link to Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs (Q2891368):
Displaying 4 items.
- Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces (Q2309464) (← links)
- Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs (Q2515567) (← links)
- Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs (Q5745127) (← links)
- Improper odd coloring of IC-planar graphs (Q6611008) (← links)