Pages that link to "Item:Q635736"
From MaRDI portal
The following pages link to Graph unique-maximum and conflict-free colorings (Q635736):
Displaying 18 items.
- Complexity of conflict-free colorings of graphs (Q484316) (← links)
- Unique-maximum coloring of plane graphs (Q907833) (← links)
- Maximum edge-colorings of graphs (Q907836) (← links)
- Conflict-free connections of graphs (Q1656907) (← links)
- On facial unique-maximum (edge-)coloring (Q1701086) (← links)
- On conflict-free connection of graphs (Q1727736) (← links)
- Maximizing and minimizing the number of generalized colorings of trees (Q1727776) (← links)
- Graphs with conflict-free connection number two (Q1756118) (← links)
- Conflict-free connection number and independence number of a graph (Q2025169) (← links)
- Conflict-free connection of trees (Q2051900) (← links)
- Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods (Q2097169) (← links)
- Remarks on proper conflict-free colorings of graphs (Q2099465) (← links)
- Colorings with neighborhood parity condition (Q2172422) (← links)
- Conflict-free connection number of random graphs (Q2192106) (← links)
- Unique-maximum edge-colouring of plane graphs with respect to faces (Q2341735) (← links)
- Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs (Q2515567) (← links)
- Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs (Q2891368) (← links)
- A survey on conflict-free connection coloring of graphs (Q6497946) (← links)
